%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : GEO254+1 : TPTP v9.3.1. Bugfixed v6.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n014.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 12:28:00 PM UTC 2026
% Result : Theorem 0.26s 0.63s
% Output : CNFRefutation 0.26s
% Verified :
% SZS Type : Refutation
% Derivation depth : 21
% Number of leaves : 10
% Syntax : Number of formulae : 65 ( 20 unt; 0 def)
% Number of atoms : 179 ( 0 equ)
% Maximal formula atoms : 19 ( 2 avg)
% Number of connectives : 183 ( 69 ~; 79 |; 27 &)
% ( 2 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 16 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 7 ( 6 usr; 1 prp; 0-3 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 116 ( 4 sgn 54 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(con,conjecture,
! [X1,X4,X2] :
( ( ~ apart_point_and_line(X4,X2)
& ~ apart_point_and_line(X1,X2)
& distinct_points(X1,X4) )
=> ( before_on_line(X2,X4,X1)
& before_on_line(X2,X1,X4) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',con) ).
fof(bf_def,axiom,
! [X2,X1,X4] :
( before_on_line(X2,X1,X4)
<=> ( ~ unequally_directed_lines(X2,line_connecting(X1,X4))
& ~ ( left_apart_point(X4,reverse_line(X2))
| left_apart_point(X4,X2) )
& ~ ( left_apart_point(X1,reverse_line(X2))
| left_apart_point(X1,X2) )
& distinct_points(X1,X4) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/GEO007+0.ax',bf_def) ).
fof(oag10,axiom,
! [X1,X2] :
~ ( left_apart_point(X1,reverse_line(X2))
| left_apart_point(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/GEO007+0.ax',oag10) ).
fof(oag1,axiom,
! [X1] : ~ distinct_points(X1,X1),
file('/export/starexec/sandbox2/benchmark/Axioms/GEO007+0.ax',oag1) ).
fof(oag2,axiom,
! [X1,X4,X5] :
( distinct_points(X1,X4)
=> ( distinct_points(X4,X5)
| distinct_points(X1,X5) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/GEO007+0.ax',oag2) ).
fof(oag6,axiom,
! [X2,X3,X6] :
( unequally_directed_lines(X2,X3)
=> ( unequally_directed_lines(X3,X6)
| unequally_directed_lines(X2,X6) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/GEO007+0.ax',oag6) ).
fof(oag9,axiom,
! [X2,X3] :
( ( unequally_directed_lines(X2,reverse_line(X3))
& unequally_directed_lines(X2,X3) )
=> ( left_convergent_lines(X2,reverse_line(X3))
| left_convergent_lines(X2,X3) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/GEO007+0.ax',oag9) ).
fof(oag11,axiom,
! [X2,X3] :
~ ( left_convergent_lines(X2,reverse_line(X3))
| left_convergent_lines(X2,X3) ),
file('/export/starexec/sandbox2/benchmark/Axioms/GEO007+0.ax',oag11) ).
fof(oag5,axiom,
! [X2] : ~ unequally_directed_lines(X2,X2),
file('/export/starexec/sandbox2/benchmark/Axioms/GEO007+0.ax',oag5) ).
fof(oagco9,axiom,
! [X1,X4] : ~ unequally_directed_lines(line_connecting(X1,X4),reverse_line(line_connecting(X4,X1))),
file('/export/starexec/sandbox2/benchmark/Axioms/GEO007+0.ax',oagco9) ).
fof(c_0_10,negated_conjecture,
~ ! [X1,X4,X2] :
( ( ~ apart_point_and_line(X4,X2)
& ~ apart_point_and_line(X1,X2)
& distinct_points(X1,X4) )
=> ( before_on_line(X2,X4,X1)
& before_on_line(X2,X1,X4) ) ),
inference(assume_negation,[status(cth)],[con]) ).
fof(c_0_11,plain,
! [X2,X1,X4] :
( before_on_line(X2,X1,X4)
<=> ( ~ unequally_directed_lines(X2,line_connecting(X1,X4))
& ~ ( left_apart_point(X4,reverse_line(X2))
| left_apart_point(X4,X2) )
& ~ ( left_apart_point(X1,reverse_line(X2))
| left_apart_point(X1,X2) )
& distinct_points(X1,X4) ) ),
inference(fof_simplification,[status(thm)],[bf_def]) ).
fof(c_0_12,negated_conjecture,
~ ! [X1,X4,X2] :
( ( ~ apart_point_and_line(X4,X2)
& ~ apart_point_and_line(X1,X2)
& distinct_points(X1,X4) )
=> ( before_on_line(X2,X4,X1)
& before_on_line(X2,X1,X4) ) ),
inference(fof_simplification,[status(thm)],[c_0_10]) ).
fof(c_0_13,plain,
! [X14,X15,X16] :
( ( before_on_line(X14,X15,X16)
| unequally_directed_lines(X14,line_connecting(X15,X16))
| left_apart_point(X16,reverse_line(X14))
| left_apart_point(X16,X14)
| left_apart_point(X15,reverse_line(X14))
| left_apart_point(X15,X14)
| ~ distinct_points(X15,X16) )
& ( ~ before_on_line(X14,X15,X16)
| ~ unequally_directed_lines(X14,line_connecting(X15,X16)) )
& ( ~ before_on_line(X14,X15,X16)
| ~ left_apart_point(X16,reverse_line(X14)) )
& ( ~ before_on_line(X14,X15,X16)
| ~ left_apart_point(X16,X14) )
& ( ~ before_on_line(X14,X15,X16)
| ~ left_apart_point(X15,reverse_line(X14)) )
& ( ~ before_on_line(X14,X15,X16)
| ~ left_apart_point(X15,X14) )
& ( ~ before_on_line(X14,X15,X16)
| distinct_points(X15,X16) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_11])])])]) ).
fof(c_0_14,plain,
! [X40,X41] :
( ~ left_apart_point(X40,reverse_line(X41))
& ~ left_apart_point(X40,X41) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[oag10])])]) ).
fof(c_0_15,plain,
! [X1] : ~ distinct_points(X1,X1),
inference(fof_simplification,[status(thm)],[oag1]) ).
fof(c_0_16,plain,
! [X22,X23,X24] :
( distinct_points(X23,X24)
| distinct_points(X22,X24)
| ~ distinct_points(X22,X23) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[oag2])])]) ).
fof(c_0_17,negated_conjecture,
( ( ~ before_on_line(esk3_0,esk2_0,esk1_0)
| ~ before_on_line(esk3_0,esk1_0,esk2_0) )
& ~ apart_point_and_line(esk2_0,esk3_0)
& ~ apart_point_and_line(esk1_0,esk3_0)
& distinct_points(esk1_0,esk2_0) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_12])])])]) ).
fof(c_0_18,plain,
! [X30,X31,X32] :
( unequally_directed_lines(X31,X32)
| unequally_directed_lines(X30,X32)
| ~ unequally_directed_lines(X30,X31) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[oag6])])]) ).
cnf(c_0_19,plain,
( ~ distinct_points(X1,X2)
| before_on_line(X3,X1,X2)
| unequally_directed_lines(X3,line_connecting(X1,X2))
| left_apart_point(X2,reverse_line(X3))
| left_apart_point(X2,X3)
| left_apart_point(X1,reverse_line(X3))
| left_apart_point(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_20,plain,
~ left_apart_point(X1,X2),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
fof(c_0_21,plain,
! [X21] : ~ distinct_points(X21,X21),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_15])]) ).
cnf(c_0_22,plain,
( ~ distinct_points(X1,X2)
| distinct_points(X2,X3)
| distinct_points(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_23,negated_conjecture,
distinct_points(esk1_0,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
fof(c_0_24,plain,
! [X38,X39] :
( left_convergent_lines(X38,reverse_line(X39))
| left_convergent_lines(X38,X39)
| ~ unequally_directed_lines(X38,reverse_line(X39))
| ~ unequally_directed_lines(X38,X39) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[oag9])])]) ).
fof(c_0_25,plain,
! [X42,X43] :
( ~ left_convergent_lines(X42,reverse_line(X43))
& ~ left_convergent_lines(X42,X43) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[oag11])])]) ).
cnf(c_0_26,plain,
( ~ unequally_directed_lines(X1,X2)
| unequally_directed_lines(X2,X3)
| unequally_directed_lines(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_27,plain,
( ~ distinct_points(X2,X3)
| unequally_directed_lines(X1,line_connecting(X2,X3))
| before_on_line(X1,X2,X3) ),
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(sr,[status(thm)],[c_0_19,c_0_20]),c_0_20]),c_0_20]),c_0_20]) ).
fof(c_0_28,plain,
! [X2] : ~ unequally_directed_lines(X2,X2),
inference(fof_simplification,[status(thm)],[oag5]) ).
cnf(c_0_29,plain,
~ distinct_points(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_30,negated_conjecture,
( distinct_points(esk1_0,X1)
| distinct_points(esk2_0,X1) ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_31,plain,
( ~ unequally_directed_lines(X1,reverse_line(X2))
| ~ unequally_directed_lines(X1,X2)
| left_convergent_lines(X1,reverse_line(X2))
| left_convergent_lines(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_32,plain,
~ left_convergent_lines(X1,X2),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_33,plain,
( ~ distinct_points(X2,X3)
| unequally_directed_lines(X1,X4)
| unequally_directed_lines(line_connecting(X2,X3),X4)
| before_on_line(X1,X2,X3) ),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
fof(c_0_34,plain,
! [X29] : ~ unequally_directed_lines(X29,X29),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_28])]) ).
cnf(c_0_35,negated_conjecture,
distinct_points(esk2_0,esk1_0),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_36,plain,
( ~ unequally_directed_lines(X1,X2)
| ~ unequally_directed_lines(X1,reverse_line(X2)) ),
inference(sr,[status(thm)],[inference(sr,[status(thm)],[c_0_31,c_0_32]),c_0_32]) ).
cnf(c_0_37,negated_conjecture,
( unequally_directed_lines(X1,X2)
| unequally_directed_lines(line_connecting(esk1_0,esk2_0),X2)
| before_on_line(X1,esk1_0,esk2_0) ),
inference(spm,[status(thm)],[c_0_33,c_0_23]) ).
cnf(c_0_38,plain,
~ unequally_directed_lines(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_34]) ).
cnf(c_0_39,negated_conjecture,
( unequally_directed_lines(X1,X2)
| unequally_directed_lines(line_connecting(esk2_0,esk1_0),X2)
| before_on_line(X1,esk2_0,esk1_0) ),
inference(spm,[status(thm)],[c_0_33,c_0_35]) ).
cnf(c_0_40,negated_conjecture,
( ~ unequally_directed_lines(line_connecting(esk1_0,esk2_0),X2)
| unequally_directed_lines(X1,reverse_line(X2))
| before_on_line(X1,esk1_0,esk2_0) ),
inference(spm,[status(thm)],[c_0_36,c_0_37]) ).
cnf(c_0_41,negated_conjecture,
( unequally_directed_lines(line_connecting(esk1_0,esk2_0),X1)
| before_on_line(X1,esk1_0,esk2_0) ),
inference(spm,[status(thm)],[c_0_38,c_0_37]) ).
cnf(c_0_42,negated_conjecture,
( ~ unequally_directed_lines(line_connecting(esk2_0,esk1_0),X2)
| unequally_directed_lines(X1,reverse_line(X2))
| before_on_line(X1,esk2_0,esk1_0) ),
inference(spm,[status(thm)],[c_0_36,c_0_39]) ).
cnf(c_0_43,negated_conjecture,
( unequally_directed_lines(line_connecting(esk2_0,esk1_0),X1)
| before_on_line(X1,esk2_0,esk1_0) ),
inference(spm,[status(thm)],[c_0_38,c_0_39]) ).
cnf(c_0_44,negated_conjecture,
( unequally_directed_lines(X2,reverse_line(X1))
| before_on_line(X2,esk1_0,esk2_0)
| before_on_line(X1,esk1_0,esk2_0) ),
inference(spm,[status(thm)],[c_0_40,c_0_41]) ).
cnf(c_0_45,negated_conjecture,
( unequally_directed_lines(X2,reverse_line(X1))
| before_on_line(X2,esk2_0,esk1_0)
| before_on_line(X1,esk2_0,esk1_0) ),
inference(spm,[status(thm)],[c_0_42,c_0_43]) ).
cnf(c_0_46,negated_conjecture,
( ~ before_on_line(esk3_0,esk2_0,esk1_0)
| ~ before_on_line(esk3_0,esk1_0,esk2_0) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_47,negated_conjecture,
( unequally_directed_lines(X1,reverse_line(X1))
| before_on_line(X1,esk1_0,esk2_0) ),
inference(ef,[status(thm)],[c_0_44]) ).
cnf(c_0_48,negated_conjecture,
( unequally_directed_lines(X1,reverse_line(X1))
| before_on_line(X1,esk2_0,esk1_0) ),
inference(ef,[status(thm)],[c_0_45]) ).
cnf(c_0_49,negated_conjecture,
unequally_directed_lines(esk3_0,reverse_line(esk3_0)),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_47]),c_0_48]) ).
cnf(c_0_50,negated_conjecture,
( unequally_directed_lines(esk3_0,X1)
| unequally_directed_lines(reverse_line(esk3_0),X1) ),
inference(spm,[status(thm)],[c_0_26,c_0_49]) ).
cnf(c_0_51,negated_conjecture,
( ~ unequally_directed_lines(reverse_line(esk3_0),X1)
| unequally_directed_lines(esk3_0,reverse_line(X1)) ),
inference(spm,[status(thm)],[c_0_36,c_0_50]) ).
cnf(c_0_52,negated_conjecture,
( unequally_directed_lines(X2,X1)
| unequally_directed_lines(esk3_0,X2)
| unequally_directed_lines(reverse_line(esk3_0),X1) ),
inference(spm,[status(thm)],[c_0_26,c_0_50]) ).
fof(c_0_53,plain,
! [X1,X4] : ~ unequally_directed_lines(line_connecting(X1,X4),reverse_line(line_connecting(X4,X1))),
inference(fof_simplification,[status(thm)],[oagco9]) ).
cnf(c_0_54,negated_conjecture,
( unequally_directed_lines(X2,X1)
| unequally_directed_lines(esk3_0,X2)
| unequally_directed_lines(esk3_0,reverse_line(X1)) ),
inference(spm,[status(thm)],[c_0_51,c_0_52]) ).
fof(c_0_55,plain,
! [X58,X59] : ~ unequally_directed_lines(line_connecting(X58,X59),reverse_line(line_connecting(X59,X58))),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_53])]) ).
cnf(c_0_56,negated_conjecture,
( ~ unequally_directed_lines(esk3_0,X2)
| unequally_directed_lines(X1,X2)
| unequally_directed_lines(esk3_0,X1) ),
inference(spm,[status(thm)],[c_0_36,c_0_54]) ).
cnf(c_0_57,negated_conjecture,
( unequally_directed_lines(esk3_0,X1)
| unequally_directed_lines(esk3_0,reverse_line(X1)) ),
inference(spm,[status(thm)],[c_0_51,c_0_50]) ).
cnf(c_0_58,plain,
~ unequally_directed_lines(line_connecting(X1,X2),reverse_line(line_connecting(X2,X1))),
inference(split_conjunct,[status(thm)],[c_0_55]) ).
cnf(c_0_59,negated_conjecture,
( unequally_directed_lines(esk3_0,X1)
| unequally_directed_lines(esk3_0,X2)
| unequally_directed_lines(X1,reverse_line(X2)) ),
inference(spm,[status(thm)],[c_0_56,c_0_57]) ).
cnf(c_0_60,negated_conjecture,
( unequally_directed_lines(esk3_0,line_connecting(X2,X1))
| unequally_directed_lines(esk3_0,line_connecting(X1,X2)) ),
inference(spm,[status(thm)],[c_0_58,c_0_59]) ).
cnf(c_0_61,negated_conjecture,
unequally_directed_lines(esk3_0,line_connecting(X1,X1)),
inference(ef,[status(thm)],[c_0_60]) ).
cnf(c_0_62,negated_conjecture,
( unequally_directed_lines(esk3_0,X2)
| unequally_directed_lines(line_connecting(X1,X1),X2) ),
inference(spm,[status(thm)],[c_0_26,c_0_61]) ).
cnf(c_0_63,negated_conjecture,
unequally_directed_lines(esk3_0,reverse_line(line_connecting(X1,X1))),
inference(spm,[status(thm)],[c_0_58,c_0_62]) ).
cnf(c_0_64,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_63]),c_0_61])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : GEO254+1 : TPTP v9.3.1. Bugfixed v6.4.0.
% 0.00/0.06 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.15/0.41 % Computer : n014.cluster.edu
% 0.15/0.41 % Model : x86_64 x86_64
% 0.15/0.41 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.41 % Memory : 8046.5625MB
% 0.15/0.41 % OS : Linux 6.8.0-71-generic
% 0.15/0.41 % CPULimit : 300
% 0.15/0.41 % WCLimit : 300
% 0.15/0.41 % DateTime : Sun Sep 20 14:42:20 UTC 2026
% 0.15/0.41 % CPUTime :
% 0.15/0.41 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.20/0.49 Running first-order theorem proving
% 0.20/0.49 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.26/0.63 % Version: 3.5.1
% 0.26/0.63 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.26/0.63 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.26/0.63 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.26/0.63 % Starting new_bool_3 with 300s (1) cores
% 0.26/0.63 % Starting new_bool_1 with 300s (1) cores
% 0.26/0.63 % Starting sh5l with 300s (1) cores
% 0.26/0.63 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 1799197 completed with status 0
% 0.26/0.63 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.26/0.63 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.26/0.63 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.26/0.63 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.26/0.63 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.26/0.63 % No SInE strategy applied
% 0.26/0.63 % Search class: FGHNF-FFMF21-SFFFFFNN
% 0.26/0.63 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.26/0.63 % Starting SubtermCWHack with 136s (1) cores
% 0.26/0.63 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.26/0.63 % Starting G-E--_200_B02_F1_SE_CS_SP_PI_S2k with 136s (1) cores
% 0.26/0.63 % Starting new_bool_3 with 136s (1) cores
% 0.26/0.63 % Starting new_bool_1 with 136s (1) cores
% 0.26/0.63 % SubtermCWHack with pid 1799203 completed with status 0
% 0.26/0.63 % Result found by SubtermCWHack
% 0.26/0.63 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.26/0.63 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.26/0.63 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.26/0.63 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.26/0.63 % No SInE strategy applied
% 0.26/0.63 % Search class: FGHNF-FFMF21-SFFFFFNN
% 0.26/0.63 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.26/0.63 % Starting SubtermCWHack with 136s (1) cores
% 0.26/0.63 % Preprocessing time : 0.003 s
% 0.26/0.63
% 0.26/0.63 % Proof found!
% 0.26/0.63 % SZS status Theorem
% 0.26/0.63 % SZS output start CNFRefutation
% See solution above
% 0.26/0.63 % Parsed axioms : 32
% 0.26/0.63 % Removed by relevancy pruning/SinE : 0
% 0.26/0.63 % Initial clauses : 62
% 0.26/0.63 % Removed in clause preprocessing : 0
% 0.26/0.63 % Initial clauses in saturation : 62
% 0.26/0.63 % Processed clauses : 1163
% 0.26/0.63 % ...of these trivial : 8
% 0.26/0.63 % ...subsumed : 902
% 0.26/0.63 % ...remaining for further processing : 253
% 0.26/0.63 % Other redundant clauses eliminated : 0
% 0.26/0.63 % Clauses deleted for lack of memory : 0
% 0.26/0.63 % Backward-subsumed : 8
% 0.26/0.63 % Backward-rewritten : 2
% 0.26/0.63 % Generated clauses : 3433
% 0.26/0.63 % ...of the previous two non-redundant : 2911
% 0.26/0.63 % ...aggressively subsumed : 0
% 0.26/0.63 % Contextual simplify-reflections : 3
% 0.26/0.63 % Paramodulations : 2473
% 0.26/0.63 % Factorizations : 960
% 0.26/0.63 % NegExts : 0
% 0.26/0.63 % Equation resolutions : 0
% 0.26/0.63 % Disequality decompositions : 0
% 0.26/0.63 % Total rewrite steps : 540
% 0.26/0.63 % ...of those cached : 515
% 0.26/0.63 % Propositional unsat checks : 0
% 0.26/0.63 % Propositional check models : 0
% 0.26/0.63 % Propositional check unsatisfiable : 0
% 0.26/0.63 % Propositional clauses : 0
% 0.26/0.63 % Propositional clauses after purity: 0
% 0.26/0.63 % Propositional unsat core size : 0
% 0.26/0.63 % Propositional preprocessing time : 0.000
% 0.26/0.63 % Propositional encoding time : 0.000
% 0.26/0.63 % Propositional solver time : 0.000
% 0.26/0.63 % Success case prop preproc time : 0.000
% 0.26/0.63 % Success case prop encoding time : 0.000
% 0.26/0.63 % Success case prop solver time : 0.000
% 0.26/0.63 % Current number of processed clauses : 243
% 0.26/0.63 % Positive orientable unit clauses : 26
% 0.26/0.63 % Positive unorientable unit clauses: 0
% 0.26/0.63 % Negative unit clauses : 11
% 0.26/0.63 % Non-unit-clauses : 206
% 0.26/0.63 % Current number of unprocessed clauses: 1807
% 0.26/0.63 % ...number of literals in the above : 9924
% 0.26/0.63 % Current number of archived formulas : 0
% 0.26/0.63 % Current number of archived clauses : 10
% 0.26/0.63 % Clause-clause subsumption calls (NU) : 22904
% 0.26/0.63 % Rec. Clause-clause subsumption calls : 7575
% 0.26/0.63 % Non-unit clause-clause subsumptions : 881
% 0.26/0.63 % Unit Clause-clause subsumption calls : 421
% 0.26/0.63 % Rewrite failures with RHS unbound : 0
% 0.26/0.63 % BW rewrite match attempts : 17
% 0.26/0.63 % BW rewrite match successes : 1
% 0.26/0.63 % Condensation attempts : 0
% 0.26/0.63 % Condensation successes : 0
% 0.26/0.63 % Termbank termtop insertions : 43219
% 0.26/0.63 % Search garbage collected termcells : 693
% 0.26/0.63
% 0.26/0.63 % -------------------------------------------------
% 0.26/0.63 % User time : 0.074 s
% 0.26/0.63 % System time : 0.006 s
% 0.26/0.63 % Total time : 0.080 s
% 0.26/0.63 % Maximum resident set size: 3676 pages
% 0.26/0.63
% 0.26/0.63 % -------------------------------------------------
% 0.26/0.63 % User time : 0.181 s
% 0.26/0.63 % System time : 0.029 s
% 0.26/0.63 % Total time : 0.211 s
% 0.26/0.63 % Maximum resident set size: 4864 pages
% 0.26/0.63 % E exiting
%------------------------------------------------------------------------------