↑ Up

E---3.5.1.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : E---3.5.1
% Problem  : PLA018-1 : TPTP v9.3.1. Released v1.1.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM

% Computer : n016.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8046.5625MB
% OS       : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Thu Sep 24 01:58:51 PM UTC 2026

% Result   : Unsatisfiable 0.31s 0.46s
% Output   : CNFRefutation 0.31s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   23
%            Number of leaves      :   26
% Syntax   : Number of clauses     :   88 (  35 unt;   0 nHn;  80 RR)
%            Number of literals    :  222 (   0 equ; 157 neg)
%            Maximal clause size   :    6 (   2 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    3 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :   14 (  14 usr;   7 con; 0-2 aty)
%            Number of variables   :  140 (  14 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(prove_AB_DC,negated_conjecture,
    ~ holds(and(on(a,b),on(d,c)),X1),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_AB_DC) ).

cnf(and_definition,axiom,
    ( ~ holds(X2,X3)
    | ~ holds(X1,X3)
    | holds(and(X1,X2),X3) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/PLA001-0.ax',and_definition) ).

cnf(putdown_2,axiom,
    ( ~ holds(clear(X2),X3)
    | ~ holds(holding(X1),X3)
    | holds(on(X1,X2),do(putdown(X1,X2),X3)) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/PLA001-0.ax',putdown_2) ).

cnf(putdown_4,axiom,
    ( ~ holds(on(X1,X2),X5)
    | holds(on(X1,X2),do(putdown(X3,X4),X5)) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/PLA001-0.ax',putdown_4) ).

cnf(pickup_1,axiom,
    ( ~ differ(X1,table)
    | ~ holds(clear(X1),X2)
    | ~ holds(empty,X2)
    | holds(holding(X1),do(pickup(X1),X2)) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/PLA001-0.ax',pickup_1) ).

cnf(differ_d_table,axiom,
    differ(d,table),
    file('/export/starexec/sandbox2/benchmark/Axioms/PLA001-1.ax',differ_d_table) ).

cnf(pickup_3,axiom,
    ( ~ differ(X1,X3)
    | ~ holds(on(X1,X2),X4)
    | holds(on(X1,X2),do(pickup(X3),X4)) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/PLA001-0.ax',pickup_3) ).

cnf(differ_a_d,axiom,
    differ(a,d),
    file('/export/starexec/sandbox2/benchmark/Axioms/PLA001-1.ax',differ_a_d) ).

cnf(pickup_4,axiom,
    ( ~ differ(X1,X2)
    | ~ holds(clear(X1),X3)
    | holds(clear(X1),do(pickup(X2),X3)) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/PLA001-0.ax',pickup_4) ).

cnf(differ_c_d,axiom,
    differ(c,d),
    file('/export/starexec/sandbox2/benchmark/Axioms/PLA001-1.ax',differ_c_d) ).

cnf(putdown_5,axiom,
    ( ~ differ(X1,X3)
    | ~ holds(clear(X1),X4)
    | holds(clear(X1),do(putdown(X2,X3),X4)) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/PLA001-0.ax',putdown_5) ).

cnf(putdown_3,axiom,
    ( ~ holds(clear(X2),X3)
    | ~ holds(holding(X1),X3)
    | holds(clear(X1),do(putdown(X1,X2),X3)) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/PLA001-0.ax',putdown_3) ).

cnf(putdown_1,axiom,
    ( ~ holds(clear(X2),X3)
    | ~ holds(holding(X1),X3)
    | holds(empty,do(putdown(X1,X2),X3)) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/PLA001-0.ax',putdown_1) ).

cnf(differ_c_table,axiom,
    differ(c,table),
    file('/export/starexec/sandbox2/benchmark/Axioms/PLA001-1.ax',differ_c_table) ).

cnf(differ_a_c,axiom,
    differ(a,c),
    file('/export/starexec/sandbox2/benchmark/Axioms/PLA001-1.ax',differ_a_c) ).

cnf(pickup_2,axiom,
    ( ~ holds(empty,X3)
    | ~ holds(clear(X2),X3)
    | ~ holds(on(X2,X1),X3)
    | holds(clear(X1),do(pickup(X2),X3)) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/PLA001-0.ax',pickup_2) ).

cnf(clear_table,axiom,
    holds(clear(table),X1),
    file('/export/starexec/sandbox2/benchmark/Axioms/PLA001-1.ax',clear_table) ).

cnf(symmetry_of_differ,axiom,
    ( ~ differ(X2,X1)
    | differ(X1,X2) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/PLA001-1.ax',symmetry_of_differ) ).

cnf(differ_b_c,axiom,
    differ(b,c),
    file('/export/starexec/sandbox2/benchmark/Axioms/PLA001-1.ax',differ_b_c) ).

cnf(differ_a_table,axiom,
    differ(a,table),
    file('/export/starexec/sandbox2/benchmark/Axioms/PLA001-1.ax',differ_a_table) ).

cnf(differ_a_b,axiom,
    differ(a,b),
    file('/export/starexec/sandbox2/benchmark/Axioms/PLA001-1.ax',differ_a_b) ).

cnf(initial_state3,axiom,
    holds(on(c,d),s0),
    file('/export/starexec/sandbox2/benchmark/Axioms/PLA001-1.ax',initial_state3) ).

cnf(initial_state5,axiom,
    holds(clear(a),s0),
    file('/export/starexec/sandbox2/benchmark/Axioms/PLA001-1.ax',initial_state5) ).

cnf(initial_state7,axiom,
    holds(clear(c),s0),
    file('/export/starexec/sandbox2/benchmark/Axioms/PLA001-1.ax',initial_state7) ).

cnf(initial_state6,axiom,
    holds(clear(b),s0),
    file('/export/starexec/sandbox2/benchmark/Axioms/PLA001-1.ax',initial_state6) ).

cnf(initial_state8,axiom,
    holds(empty,s0),
    file('/export/starexec/sandbox2/benchmark/Axioms/PLA001-1.ax',initial_state8) ).

cnf(c_0_26,negated_conjecture,
    ~ holds(and(on(a,b),on(d,c)),X1),
    inference(fof_simplification,[status(thm)],[prove_AB_DC]) ).

cnf(c_0_27,plain,
    ( ~ holds(X2,X3)
    | ~ holds(X1,X3)
    | holds(and(X1,X2),X3) ),
    inference(fof_simplification,[status(thm)],[and_definition]) ).

cnf(c_0_28,negated_conjecture,
    ~ holds(and(on(a,b),on(d,c)),X1),
    c_0_26 ).

cnf(c_0_29,plain,
    ( ~ holds(X2,X3)
    | ~ holds(X1,X3)
    | holds(and(X1,X2),X3) ),
    c_0_27 ).

cnf(c_0_30,plain,
    ( ~ holds(clear(X2),X3)
    | ~ holds(holding(X1),X3)
    | holds(on(X1,X2),do(putdown(X1,X2),X3)) ),
    inference(fof_simplification,[status(thm)],[putdown_2]) ).

cnf(c_0_31,negated_conjecture,
    ( ~ holds(on(a,b),X1)
    | ~ holds(on(d,c),X1) ),
    inference(spm,[status(thm)],[c_0_28,c_0_29]) ).

cnf(c_0_32,plain,
    ( ~ holds(clear(X2),X3)
    | ~ holds(holding(X1),X3)
    | holds(on(X1,X2),do(putdown(X1,X2),X3)) ),
    c_0_30 ).

cnf(c_0_33,plain,
    ( ~ holds(on(X1,X2),X5)
    | holds(on(X1,X2),do(putdown(X3,X4),X5)) ),
    inference(fof_simplification,[status(thm)],[putdown_4]) ).

cnf(c_0_34,negated_conjecture,
    ( ~ holds(clear(c),X1)
    | ~ holds(holding(d),X1)
    | ~ holds(on(a,b),do(putdown(d,c),X1)) ),
    inference(spm,[status(thm)],[c_0_31,c_0_32]) ).

cnf(c_0_35,plain,
    ( ~ holds(on(X1,X2),X5)
    | holds(on(X1,X2),do(putdown(X3,X4),X5)) ),
    c_0_33 ).

cnf(c_0_36,plain,
    ( ~ differ(X1,table)
    | ~ holds(clear(X1),X2)
    | ~ holds(empty,X2)
    | holds(holding(X1),do(pickup(X1),X2)) ),
    inference(fof_simplification,[status(thm)],[pickup_1]) ).

cnf(c_0_37,negated_conjecture,
    ( ~ holds(clear(c),X1)
    | ~ holds(holding(d),X1)
    | ~ holds(on(a,b),X1) ),
    inference(spm,[status(thm)],[c_0_34,c_0_35]) ).

cnf(c_0_38,plain,
    ( ~ differ(X1,table)
    | ~ holds(clear(X1),X2)
    | ~ holds(empty,X2)
    | holds(holding(X1),do(pickup(X1),X2)) ),
    c_0_36 ).

cnf(c_0_39,axiom,
    differ(d,table),
    differ_d_table ).

cnf(c_0_40,plain,
    ( ~ differ(X1,X3)
    | ~ holds(on(X1,X2),X4)
    | holds(on(X1,X2),do(pickup(X3),X4)) ),
    inference(fof_simplification,[status(thm)],[pickup_3]) ).

cnf(c_0_41,negated_conjecture,
    ( ~ holds(empty,X1)
    | ~ holds(clear(d),X1)
    | ~ holds(clear(c),do(pickup(d),X1))
    | ~ holds(on(a,b),do(pickup(d),X1)) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_38]),c_0_39])]) ).

cnf(c_0_42,plain,
    ( ~ differ(X1,X3)
    | ~ holds(on(X1,X2),X4)
    | holds(on(X1,X2),do(pickup(X3),X4)) ),
    c_0_40 ).

cnf(c_0_43,axiom,
    differ(a,d),
    differ_a_d ).

cnf(c_0_44,plain,
    ( ~ differ(X1,X2)
    | ~ holds(clear(X1),X3)
    | holds(clear(X1),do(pickup(X2),X3)) ),
    inference(fof_simplification,[status(thm)],[pickup_4]) ).

cnf(c_0_45,negated_conjecture,
    ( ~ holds(empty,X1)
    | ~ holds(clear(d),X1)
    | ~ holds(on(a,b),X1)
    | ~ holds(clear(c),do(pickup(d),X1)) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_42]),c_0_43])]) ).

cnf(c_0_46,plain,
    ( ~ differ(X1,X2)
    | ~ holds(clear(X1),X3)
    | holds(clear(X1),do(pickup(X2),X3)) ),
    c_0_44 ).

cnf(c_0_47,axiom,
    differ(c,d),
    differ_c_d ).

cnf(c_0_48,negated_conjecture,
    ( ~ holds(empty,X1)
    | ~ holds(clear(c),X1)
    | ~ holds(clear(d),X1)
    | ~ holds(on(a,b),X1) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_46]),c_0_47])]) ).

cnf(c_0_49,plain,
    ( ~ differ(X1,X3)
    | ~ holds(clear(X1),X4)
    | holds(clear(X1),do(putdown(X2,X3),X4)) ),
    inference(fof_simplification,[status(thm)],[putdown_5]) ).

cnf(c_0_50,negated_conjecture,
    ( ~ holds(on(a,b),X3)
    | ~ holds(empty,do(putdown(X1,X2),X3))
    | ~ holds(clear(c),do(putdown(X1,X2),X3))
    | ~ holds(clear(d),do(putdown(X1,X2),X3)) ),
    inference(spm,[status(thm)],[c_0_48,c_0_35]) ).

cnf(c_0_51,plain,
    ( ~ differ(X1,X3)
    | ~ holds(clear(X1),X4)
    | holds(clear(X1),do(putdown(X2,X3),X4)) ),
    c_0_49 ).

cnf(c_0_52,plain,
    ( ~ holds(clear(X2),X3)
    | ~ holds(holding(X1),X3)
    | holds(clear(X1),do(putdown(X1,X2),X3)) ),
    inference(fof_simplification,[status(thm)],[putdown_3]) ).

cnf(c_0_53,plain,
    ( ~ holds(clear(X2),X3)
    | ~ holds(holding(X1),X3)
    | holds(empty,do(putdown(X1,X2),X3)) ),
    inference(fof_simplification,[status(thm)],[putdown_1]) ).

cnf(c_0_54,negated_conjecture,
    ( ~ holds(clear(d),X3)
    | ~ holds(on(a,b),X3)
    | ~ holds(empty,do(putdown(X2,X1),X3))
    | ~ holds(clear(c),do(putdown(X2,X1),X3))
    | ~ differ(d,X1) ),
    inference(spm,[status(thm)],[c_0_50,c_0_51]) ).

cnf(c_0_55,plain,
    ( ~ holds(clear(X2),X3)
    | ~ holds(holding(X1),X3)
    | holds(clear(X1),do(putdown(X1,X2),X3)) ),
    c_0_52 ).

cnf(c_0_56,plain,
    ( ~ holds(clear(X2),X3)
    | ~ holds(holding(X1),X3)
    | holds(empty,do(putdown(X1,X2),X3)) ),
    c_0_53 ).

cnf(c_0_57,negated_conjecture,
    ( ~ holds(clear(X1),X2)
    | ~ holds(holding(c),X2)
    | ~ holds(clear(d),X2)
    | ~ holds(on(a,b),X2)
    | ~ differ(d,X1) ),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_55]),c_0_56]) ).

cnf(c_0_58,axiom,
    differ(c,table),
    differ_c_table ).

cnf(c_0_59,negated_conjecture,
    ( ~ holds(empty,X2)
    | ~ holds(clear(c),X2)
    | ~ holds(clear(X1),do(pickup(c),X2))
    | ~ holds(clear(d),do(pickup(c),X2))
    | ~ holds(on(a,b),do(pickup(c),X2))
    | ~ differ(d,X1) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_57,c_0_38]),c_0_58])]) ).

cnf(c_0_60,axiom,
    differ(a,c),
    differ_a_c ).

cnf(c_0_61,plain,
    ( ~ holds(empty,X3)
    | ~ holds(clear(X2),X3)
    | ~ holds(on(X2,X1),X3)
    | holds(clear(X1),do(pickup(X2),X3)) ),
    inference(fof_simplification,[status(thm)],[pickup_2]) ).

cnf(c_0_62,negated_conjecture,
    ( ~ holds(empty,X2)
    | ~ holds(clear(c),X2)
    | ~ holds(on(a,b),X2)
    | ~ holds(clear(X1),do(pickup(c),X2))
    | ~ holds(clear(d),do(pickup(c),X2))
    | ~ differ(d,X1) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_59,c_0_42]),c_0_60])]) ).

cnf(c_0_63,plain,
    ( ~ holds(empty,X3)
    | ~ holds(clear(X2),X3)
    | ~ holds(on(X2,X1),X3)
    | holds(clear(X1),do(pickup(X2),X3)) ),
    c_0_61 ).

cnf(c_0_64,negated_conjecture,
    ( ~ holds(empty,X2)
    | ~ holds(clear(c),X2)
    | ~ holds(on(c,d),X2)
    | ~ holds(on(a,b),X2)
    | ~ holds(clear(X1),do(pickup(c),X2))
    | ~ differ(d,X1) ),
    inference(spm,[status(thm)],[c_0_62,c_0_63]) ).

cnf(c_0_65,axiom,
    holds(clear(table),X1),
    clear_table ).

cnf(c_0_66,negated_conjecture,
    ( ~ holds(empty,X1)
    | ~ holds(clear(c),X1)
    | ~ holds(on(c,d),X1)
    | ~ holds(on(a,b),X1) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_64,c_0_65]),c_0_39])]) ).

cnf(c_0_67,plain,
    ( ~ differ(X2,X1)
    | differ(X1,X2) ),
    inference(fof_simplification,[status(thm)],[symmetry_of_differ]) ).

cnf(c_0_68,negated_conjecture,
    ( ~ holds(on(c,d),X3)
    | ~ holds(empty,do(putdown(X1,X2),X3))
    | ~ holds(clear(c),do(putdown(X1,X2),X3))
    | ~ holds(on(a,b),do(putdown(X1,X2),X3)) ),
    inference(spm,[status(thm)],[c_0_66,c_0_35]) ).

cnf(c_0_69,plain,
    ( ~ differ(X2,X1)
    | differ(X1,X2) ),
    c_0_67 ).

cnf(c_0_70,axiom,
    differ(b,c),
    differ_b_c ).

cnf(c_0_71,negated_conjecture,
    ( ~ holds(clear(b),X1)
    | ~ holds(holding(a),X1)
    | ~ holds(on(c,d),X1)
    | ~ holds(clear(c),do(putdown(a,b),X1)) ),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_68,c_0_32]),c_0_56]) ).

cnf(c_0_72,plain,
    differ(c,b),
    inference(spm,[status(thm)],[c_0_69,c_0_70]) ).

cnf(c_0_73,negated_conjecture,
    ( ~ holds(clear(c),X1)
    | ~ holds(clear(b),X1)
    | ~ holds(holding(a),X1)
    | ~ holds(on(c,d),X1) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_71,c_0_51]),c_0_72])]) ).

cnf(c_0_74,axiom,
    differ(a,table),
    differ_a_table ).

cnf(c_0_75,negated_conjecture,
    ( ~ holds(empty,X1)
    | ~ holds(clear(a),X1)
    | ~ holds(clear(c),do(pickup(a),X1))
    | ~ holds(clear(b),do(pickup(a),X1))
    | ~ holds(on(c,d),do(pickup(a),X1)) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_73,c_0_38]),c_0_74])]) ).

cnf(c_0_76,plain,
    differ(c,a),
    inference(spm,[status(thm)],[c_0_69,c_0_60]) ).

cnf(c_0_77,negated_conjecture,
    ( ~ holds(empty,X1)
    | ~ holds(clear(a),X1)
    | ~ holds(on(c,d),X1)
    | ~ holds(clear(c),do(pickup(a),X1))
    | ~ holds(clear(b),do(pickup(a),X1)) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_75,c_0_42]),c_0_76])]) ).

cnf(c_0_78,axiom,
    differ(a,b),
    differ_a_b ).

cnf(c_0_79,negated_conjecture,
    ( ~ holds(empty,X1)
    | ~ holds(clear(c),X1)
    | ~ holds(clear(a),X1)
    | ~ holds(on(c,d),X1)
    | ~ holds(clear(b),do(pickup(a),X1)) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_77,c_0_46]),c_0_76])]) ).

cnf(c_0_80,plain,
    differ(b,a),
    inference(spm,[status(thm)],[c_0_69,c_0_78]) ).

cnf(c_0_81,negated_conjecture,
    ( ~ holds(empty,X1)
    | ~ holds(clear(b),X1)
    | ~ holds(clear(c),X1)
    | ~ holds(clear(a),X1)
    | ~ holds(on(c,d),X1) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_79,c_0_46]),c_0_80])]) ).

cnf(c_0_82,axiom,
    holds(on(c,d),s0),
    initial_state3 ).

cnf(c_0_83,axiom,
    holds(clear(a),s0),
    initial_state5 ).

cnf(c_0_84,axiom,
    holds(clear(c),s0),
    initial_state7 ).

cnf(c_0_85,axiom,
    holds(clear(b),s0),
    initial_state6 ).

cnf(c_0_86,axiom,
    holds(empty,s0),
    initial_state8 ).

cnf(c_0_87,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_81,c_0_82]),c_0_83]),c_0_84]),c_0_85]),c_0_86])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : PLA018-1 : TPTP v9.3.1. Released v1.1.0.
% 0.00/0.04  % Command  : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.38  % Computer : n016.cluster.edu
% 0.11/0.38  % Model    : x86_64 x86_64
% 0.11/0.38  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.38  % Memory   : 8046.5625MB
% 0.11/0.38  % OS       : Linux 6.8.0-71-generic
% 0.11/0.38  % CPULimit : 300
% 0.11/0.38  % WCLimit  : 300
% 0.11/0.38  % DateTime : Mon Sep 21 03:37:09 UTC 2026
% 0.11/0.38  % CPUTime  : 
% 0.11/0.38  Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.43  Running first-order theorem proving
% 0.11/0.43  Running: /export/starexec/sandbox2/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.31/0.46  % Version: 3.5.1
% 0.31/0.46  % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.31/0.46  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.31/0.46  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.31/0.46  % Starting new_bool_3 with 300s (1) cores
% 0.31/0.46  % Starting new_bool_1 with 300s (1) cores
% 0.31/0.46  % Starting sh5l with 300s (1) cores
% 0.31/0.46  % sh5l with pid 1466843 completed with status 0
% 0.31/0.46  % Result found by sh5l
% 0.31/0.46  % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.31/0.46  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.31/0.46  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.31/0.46  % Starting new_bool_3 with 300s (1) cores
% 0.31/0.46  % Starting new_bool_1 with 300s (1) cores
% 0.31/0.46  % Starting sh5l with 300s (1) cores
% 0.31/0.46  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.31/0.46  % SinE strategy is gf500_gu_R04_F100_L20000
% 0.31/0.46  % Search class: FHUNF-FFMM21-SFFFFFNN
% 0.31/0.46  % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.31/0.46  % Starting SubtermCWHack with 31s (1) cores
% 0.31/0.46  % SubtermCWHack with pid 1466850 completed with status 0
% 0.31/0.46  % Result found by SubtermCWHack
% 0.31/0.46  % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.31/0.46  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.31/0.46  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.31/0.46  % Starting new_bool_3 with 300s (1) cores
% 0.31/0.46  % Starting new_bool_1 with 300s (1) cores
% 0.31/0.46  % Starting sh5l with 300s (1) cores
% 0.31/0.46  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.31/0.46  % SinE strategy is gf500_gu_R04_F100_L20000
% 0.31/0.46  % Search class: FHUNF-FFMM21-SFFFFFNN
% 0.31/0.46  % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.31/0.46  % Starting SubtermCWHack with 31s (1) cores
% 0.31/0.46  % Preprocessing time       : 0.001 s
% 0.31/0.46  
% 0.31/0.46  % Proof found!
% 0.31/0.46  % SZS status Unsatisfiable
% 0.31/0.46  % SZS output start CNFRefutation
% See solution above
% 0.31/0.46  % Parsed axioms                        : 31
% 0.31/0.46  % Removed by relevancy pruning/SinE    : 0
% 0.31/0.46  % Initial clauses                      : 31
% 0.31/0.46  % Removed in clause preprocessing      : 0
% 0.31/0.46  % Initial clauses in saturation        : 31
% 0.31/0.46  % Processed clauses                    : 136
% 0.31/0.46  % ...of these trivial                  : 0
% 0.31/0.46  % ...subsumed                          : 10
% 0.31/0.46  % ...remaining for further processing  : 126
% 0.31/0.46  % Other redundant clauses eliminated   : 0
% 0.31/0.46  % Clauses deleted for lack of memory   : 0
% 0.31/0.46  % Backward-subsumed                    : 1
% 0.31/0.46  % Backward-rewritten                   : 0
% 0.31/0.46  % Generated clauses                    : 175
% 0.31/0.46  % ...of the previous two non-redundant : 161
% 0.31/0.46  % ...aggressively subsumed             : 0
% 0.31/0.46  % Contextual simplify-reflections      : 7
% 0.31/0.46  % Paramodulations                      : 175
% 0.31/0.46  % Factorizations                       : 0
% 0.31/0.46  % NegExts                              : 0
% 0.31/0.46  % Equation resolutions                 : 0
% 0.31/0.46  % Disequality decompositions           : 0
% 0.31/0.46  % Total rewrite steps                  : 53
% 0.31/0.46  % ...of those cached                   : 33
% 0.31/0.46  % Propositional unsat checks           : 0
% 0.31/0.46  %    Propositional check models        : 0
% 0.31/0.46  %    Propositional check unsatisfiable : 0
% 0.31/0.46  %    Propositional clauses             : 0
% 0.31/0.46  %    Propositional clauses after purity: 0
% 0.31/0.46  %    Propositional unsat core size     : 0
% 0.31/0.46  %    Propositional preprocessing time  : 0.000
% 0.31/0.46  %    Propositional encoding time       : 0.000
% 0.31/0.46  %    Propositional solver time         : 0.000
% 0.31/0.46  %    Success case prop preproc time    : 0.000
% 0.31/0.46  %    Success case prop encoding time   : 0.000
% 0.31/0.46  %    Success case prop solver time     : 0.000
% 0.31/0.46  % Current number of processed clauses  : 125
% 0.31/0.46  %    Positive orientable unit clauses  : 29
% 0.31/0.46  %    Positive unorientable unit clauses: 0
% 0.31/0.46  %    Negative unit clauses             : 2
% 0.31/0.46  %    Non-unit-clauses                  : 94
% 0.31/0.46  % Current number of unprocessed clauses: 54
% 0.31/0.46  % ...number of literals in the above   : 328
% 0.31/0.46  % Current number of archived formulas  : 0
% 0.31/0.46  % Current number of archived clauses   : 1
% 0.31/0.46  % Clause-clause subsumption calls (NU) : 6433
% 0.31/0.46  % Rec. Clause-clause subsumption calls : 253
% 0.31/0.46  % Non-unit clause-clause subsumptions  : 18
% 0.31/0.46  % Unit Clause-clause subsumption calls : 60
% 0.31/0.46  % Rewrite failures with RHS unbound    : 0
% 0.31/0.46  % BW rewrite match attempts            : 0
% 0.31/0.46  % BW rewrite match successes           : 0
% 0.31/0.46  % Condensation attempts                : 0
% 0.31/0.46  % Condensation successes               : 0
% 0.31/0.46  % Termbank termtop insertions          : 7368
% 0.31/0.46  % Search garbage collected termcells   : 55
% 0.31/0.46  
% 0.31/0.46  % -------------------------------------------------
% 0.31/0.46  % User time                : 0.014 s
% 0.31/0.46  % System time              : 0.003 s
% 0.31/0.46  % Total time               : 0.017 s
% 0.31/0.46  % Maximum resident set size: 3660 pages
% 0.31/0.46  
% 0.31/0.46  % -------------------------------------------------
% 0.31/0.46  % User time                : 0.014 s
% 0.31/0.46  % System time              : 0.010 s
% 0.31/0.46  % Total time               : 0.024 s
% 0.31/0.46  % Maximum resident set size: 4864 pages
% 0.31/0.46  % E exiting
%------------------------------------------------------------------------------