%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : GEO203+3 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n007.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:27:44 PM UTC 2026
% Result : Theorem 0.54s 0.53s
% Output : CNFRefutation 0.54s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 11
% Syntax : Number of formulae : 59 ( 18 unt; 0 def)
% Number of atoms : 134 ( 0 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 119 ( 44 ~; 52 |; 9 &)
% ( 2 <=>; 12 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 6 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 92 ( 0 sgn 60 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(con,conjecture,
! [X1,X2,X3] :
( ( distinct_points(intersection_point(X1,X2),intersection_point(X1,X3))
& convergent_lines(X1,X3)
& convergent_lines(X1,X2) )
=> equal_lines(line_connecting(intersection_point(X1,X2),intersection_point(X1,X3)),X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',con) ).
fof(ax2,axiom,
! [X1,X2] :
( equal_lines(X1,X2)
<=> ~ distinct_lines(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/GEO006+6.ax',ax2) ).
fof(apart4,axiom,
! [X1,X2,X3] :
( distinct_points(X1,X2)
=> ( distinct_points(X2,X3)
| distinct_points(X1,X3) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/GEO006+0.ax',apart4) ).
fof(apart1,axiom,
! [X1] : ~ distinct_points(X1,X1),
file('/export/starexec/sandbox2/benchmark/Axioms/GEO006+0.ax',apart1) ).
fof(p1,axiom,
! [X1,X2] :
( distinct_lines(X1,X2)
=> convergent_lines(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/GEO006+1.ax',p1) ).
fof(apart3,axiom,
! [X1] : ~ convergent_lines(X1,X1),
file('/export/starexec/sandbox2/benchmark/Axioms/GEO006+0.ax',apart3) ).
fof(ceq3,axiom,
! [X1,X2,X3] :
( convergent_lines(X1,X2)
=> ( convergent_lines(X1,X3)
| distinct_lines(X2,X3) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/GEO006+0.ax',ceq3) ).
fof(cu1,axiom,
! [X1,X2,X4,X5] :
( ( distinct_lines(X4,X5)
& distinct_points(X1,X2) )
=> ( apart_point_and_line(X2,X5)
| apart_point_and_line(X2,X4)
| apart_point_and_line(X1,X5)
| apart_point_and_line(X1,X4) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/GEO006+0.ax',cu1) ).
fof(ci2,axiom,
! [X1,X2] :
( distinct_points(X1,X2)
=> ~ apart_point_and_line(X2,line_connecting(X1,X2)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/GEO006+0.ax',ci2) ).
fof(ci1,axiom,
! [X1,X2] :
( distinct_points(X1,X2)
=> ~ apart_point_and_line(X1,line_connecting(X1,X2)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/GEO006+0.ax',ci1) ).
fof(ci3,axiom,
! [X1,X2] :
( convergent_lines(X1,X2)
=> ~ apart_point_and_line(intersection_point(X1,X2),X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/GEO006+0.ax',ci3) ).
fof(c_0_11,negated_conjecture,
~ ! [X1,X2,X3] :
( ( distinct_points(intersection_point(X1,X2),intersection_point(X1,X3))
& convergent_lines(X1,X3)
& convergent_lines(X1,X2) )
=> equal_lines(line_connecting(intersection_point(X1,X2),intersection_point(X1,X3)),X1) ),
inference(assume_negation,[status(cth)],[con]) ).
fof(c_0_12,plain,
! [X1,X2] :
( equal_lines(X1,X2)
<=> ~ distinct_lines(X1,X2) ),
inference(fof_simplification,[status(thm)],[ax2]) ).
fof(c_0_13,plain,
! [X14,X15,X16] :
( distinct_points(X15,X16)
| distinct_points(X14,X16)
| ~ distinct_points(X14,X15) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[apart4])])]) ).
fof(c_0_14,negated_conjecture,
( ~ equal_lines(line_connecting(intersection_point(esk1_0,esk2_0),intersection_point(esk1_0,esk3_0)),esk1_0)
& distinct_points(intersection_point(esk1_0,esk2_0),intersection_point(esk1_0,esk3_0))
& convergent_lines(esk1_0,esk3_0)
& convergent_lines(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_11])])])]) ).
fof(c_0_15,plain,
! [X84,X85] :
( ( equal_lines(X84,X85)
| distinct_lines(X84,X85) )
& ( ~ distinct_lines(X84,X85)
| ~ equal_lines(X84,X85) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_12])])]) ).
fof(c_0_16,plain,
! [X1] : ~ distinct_points(X1,X1),
inference(fof_simplification,[status(thm)],[apart1]) ).
cnf(c_0_17,plain,
( ~ distinct_points(X1,X2)
| distinct_points(X2,X3)
| distinct_points(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_18,negated_conjecture,
distinct_points(intersection_point(esk1_0,esk2_0),intersection_point(esk1_0,esk3_0)),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
fof(c_0_19,plain,
! [X44,X45] :
( convergent_lines(X44,X45)
| ~ distinct_lines(X44,X45) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[p1])])]) ).
cnf(c_0_20,negated_conjecture,
~ equal_lines(line_connecting(intersection_point(esk1_0,esk2_0),intersection_point(esk1_0,esk3_0)),esk1_0),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_21,plain,
( equal_lines(X1,X2)
| distinct_lines(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
fof(c_0_22,plain,
! [X11] : ~ distinct_points(X11,X11),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_16])]) ).
cnf(c_0_23,negated_conjecture,
( distinct_points(intersection_point(esk1_0,esk3_0),X1)
| distinct_points(intersection_point(esk1_0,esk2_0),X1) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
fof(c_0_24,plain,
! [X1] : ~ convergent_lines(X1,X1),
inference(fof_simplification,[status(thm)],[apart3]) ).
fof(c_0_25,plain,
! [X41,X42,X43] :
( convergent_lines(X41,X43)
| distinct_lines(X42,X43)
| ~ convergent_lines(X41,X42) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ceq3])])]) ).
cnf(c_0_26,plain,
( ~ distinct_lines(X1,X2)
| convergent_lines(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_27,negated_conjecture,
distinct_lines(line_connecting(intersection_point(esk1_0,esk2_0),intersection_point(esk1_0,esk3_0)),esk1_0),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_28,plain,
~ distinct_points(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_29,negated_conjecture,
( distinct_points(X1,X2)
| distinct_points(intersection_point(esk1_0,esk3_0),X2)
| distinct_points(intersection_point(esk1_0,esk2_0),X1) ),
inference(spm,[status(thm)],[c_0_17,c_0_23]) ).
fof(c_0_30,plain,
! [X13] : ~ convergent_lines(X13,X13),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_24])]) ).
cnf(c_0_31,plain,
( ~ convergent_lines(X1,X2)
| convergent_lines(X1,X3)
| distinct_lines(X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_32,negated_conjecture,
convergent_lines(line_connecting(intersection_point(esk1_0,esk2_0),intersection_point(esk1_0,esk3_0)),esk1_0),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_33,negated_conjecture,
( distinct_points(intersection_point(esk1_0,esk2_0),X1)
| distinct_points(X1,intersection_point(esk1_0,esk3_0)) ),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
fof(c_0_34,plain,
! [X31,X32,X33,X34] :
( apart_point_and_line(X32,X34)
| apart_point_and_line(X32,X33)
| apart_point_and_line(X31,X34)
| apart_point_and_line(X31,X33)
| ~ distinct_lines(X33,X34)
| ~ distinct_points(X31,X32) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[cu1])])]) ).
cnf(c_0_35,plain,
~ convergent_lines(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
cnf(c_0_36,negated_conjecture,
( distinct_lines(esk1_0,X1)
| convergent_lines(line_connecting(intersection_point(esk1_0,esk2_0),intersection_point(esk1_0,esk3_0)),X1) ),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_37,negated_conjecture,
( distinct_points(X1,X2)
| distinct_points(intersection_point(esk1_0,esk2_0),X2)
| distinct_points(X1,intersection_point(esk1_0,esk3_0)) ),
inference(spm,[status(thm)],[c_0_17,c_0_33]) ).
fof(c_0_38,plain,
! [X1,X2] :
( distinct_points(X1,X2)
=> ~ apart_point_and_line(X2,line_connecting(X1,X2)) ),
inference(fof_simplification,[status(thm)],[ci2]) ).
cnf(c_0_39,plain,
( ~ distinct_lines(X3,X4)
| ~ distinct_points(X1,X2)
| apart_point_and_line(X2,X4)
| apart_point_and_line(X2,X3)
| apart_point_and_line(X1,X4)
| apart_point_and_line(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_34]) ).
cnf(c_0_40,negated_conjecture,
distinct_lines(esk1_0,line_connecting(intersection_point(esk1_0,esk2_0),intersection_point(esk1_0,esk3_0))),
inference(spm,[status(thm)],[c_0_35,c_0_36]) ).
cnf(c_0_41,negated_conjecture,
( distinct_points(X1,intersection_point(esk1_0,esk3_0))
| distinct_points(X1,intersection_point(esk1_0,esk2_0)) ),
inference(spm,[status(thm)],[c_0_28,c_0_37]) ).
fof(c_0_42,plain,
! [X1,X2] :
( distinct_points(X1,X2)
=> ~ apart_point_and_line(X1,line_connecting(X1,X2)) ),
inference(fof_simplification,[status(thm)],[ci1]) ).
fof(c_0_43,plain,
! [X25,X26] :
( ~ apart_point_and_line(X26,line_connecting(X25,X26))
| ~ distinct_points(X25,X26) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_38])])]) ).
cnf(c_0_44,negated_conjecture,
( ~ distinct_points(X1,X2)
| apart_point_and_line(X2,esk1_0)
| apart_point_and_line(X1,esk1_0)
| apart_point_and_line(X2,line_connecting(intersection_point(esk1_0,esk2_0),intersection_point(esk1_0,esk3_0)))
| apart_point_and_line(X1,line_connecting(intersection_point(esk1_0,esk2_0),intersection_point(esk1_0,esk3_0))) ),
inference(spm,[status(thm)],[c_0_39,c_0_40]) ).
cnf(c_0_45,negated_conjecture,
distinct_points(intersection_point(esk1_0,esk3_0),intersection_point(esk1_0,esk2_0)),
inference(spm,[status(thm)],[c_0_28,c_0_41]) ).
fof(c_0_46,plain,
! [X1,X2] :
( convergent_lines(X1,X2)
=> ~ apart_point_and_line(intersection_point(X1,X2),X1) ),
inference(fof_simplification,[status(thm)],[ci3]) ).
fof(c_0_47,plain,
! [X23,X24] :
( ~ apart_point_and_line(X23,line_connecting(X23,X24))
| ~ distinct_points(X23,X24) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_42])])]) ).
cnf(c_0_48,plain,
( ~ apart_point_and_line(X2,line_connecting(X1,X2))
| ~ distinct_points(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_43]) ).
cnf(c_0_49,negated_conjecture,
( apart_point_and_line(intersection_point(esk1_0,esk3_0),esk1_0)
| apart_point_and_line(intersection_point(esk1_0,esk2_0),esk1_0)
| apart_point_and_line(intersection_point(esk1_0,esk3_0),line_connecting(intersection_point(esk1_0,esk2_0),intersection_point(esk1_0,esk3_0)))
| apart_point_and_line(intersection_point(esk1_0,esk2_0),line_connecting(intersection_point(esk1_0,esk2_0),intersection_point(esk1_0,esk3_0))) ),
inference(spm,[status(thm)],[c_0_44,c_0_45]) ).
fof(c_0_50,plain,
! [X27,X28] :
( ~ apart_point_and_line(intersection_point(X27,X28),X27)
| ~ convergent_lines(X27,X28) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_46])])]) ).
cnf(c_0_51,plain,
( ~ apart_point_and_line(X1,line_connecting(X1,X2))
| ~ distinct_points(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_47]) ).
cnf(c_0_52,negated_conjecture,
( apart_point_and_line(intersection_point(esk1_0,esk2_0),esk1_0)
| apart_point_and_line(intersection_point(esk1_0,esk3_0),esk1_0)
| apart_point_and_line(intersection_point(esk1_0,esk2_0),line_connecting(intersection_point(esk1_0,esk2_0),intersection_point(esk1_0,esk3_0))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_49]),c_0_18])]) ).
cnf(c_0_53,plain,
( ~ apart_point_and_line(intersection_point(X1,X2),X1)
| ~ convergent_lines(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_50]) ).
cnf(c_0_54,negated_conjecture,
( apart_point_and_line(intersection_point(esk1_0,esk3_0),esk1_0)
| apart_point_and_line(intersection_point(esk1_0,esk2_0),esk1_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_52]),c_0_18])]) ).
cnf(c_0_55,negated_conjecture,
convergent_lines(esk1_0,esk3_0),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_56,negated_conjecture,
apart_point_and_line(intersection_point(esk1_0,esk2_0),esk1_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_54]),c_0_55])]) ).
cnf(c_0_57,negated_conjecture,
convergent_lines(esk1_0,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_58,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_56]),c_0_57])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : GEO203+3 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.36 % Computer : n007.cluster.edu
% 0.09/0.36 % Model : x86_64 x86_64
% 0.09/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36 % Memory : 8046.5625MB
% 0.09/0.36 % OS : Linux 6.8.0-71-generic
% 0.09/0.36 % CPULimit : 300
% 0.09/0.36 % WCLimit : 300
% 0.09/0.36 % DateTime : Sun Sep 20 13:21:51 UTC 2026
% 0.09/0.36 % CPUTime :
% 0.09/0.36 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.40 Running first-order theorem proving
% 0.09/0.40 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.54/0.53 % Version: 3.5.1
% 0.54/0.53 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.54/0.53 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.54/0.53 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.54/0.53 % Starting new_bool_3 with 300s (1) cores
% 0.54/0.53 % Starting new_bool_1 with 300s (1) cores
% 0.54/0.53 % Starting sh5l with 300s (1) cores
% 0.54/0.53 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 2966694 completed with status 0
% 0.54/0.53 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.54/0.53 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.54/0.53 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.54/0.53 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.54/0.53 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.54/0.53 % No SInE strategy applied
% 0.54/0.53 % Search class: FGHNF-FFMS22-SFFFFFNN
% 0.54/0.53 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.54/0.53 % Starting SubtermCWHack with 136s (1) cores
% 0.54/0.53 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.54/0.53 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.54/0.53 % Starting new_bool_3 with 136s (1) cores
% 0.54/0.53 % Starting new_bool_1 with 136s (1) cores
% 0.54/0.53 % G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with pid 2966701 completed with status 0
% 0.54/0.53 % Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y
% 0.54/0.53 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.54/0.53 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.54/0.53 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.54/0.53 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.54/0.53 % No SInE strategy applied
% 0.54/0.53 % Search class: FGHNF-FFMS22-SFFFFFNN
% 0.54/0.53 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.54/0.53 % Starting SubtermCWHack with 136s (1) cores
% 0.54/0.53 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.54/0.53 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.54/0.53 % Preprocessing time : 0.001 s
% 0.54/0.53 % Presaturation interreduction done
% 0.54/0.53
% 0.54/0.53 % Proof found!
% 0.54/0.53 % SZS status Theorem
% 0.54/0.53 % SZS output start CNFRefutation
% See solution above
% 0.54/0.53 % Parsed axioms : 36
% 0.54/0.53 % Removed by relevancy pruning/SinE : 0
% 0.54/0.53 % Initial clauses : 50
% 0.54/0.53 % Removed in clause preprocessing : 0
% 0.54/0.53 % Initial clauses in saturation : 50
% 0.54/0.53 % Processed clauses : 1008
% 0.54/0.53 % ...of these trivial : 12
% 0.54/0.53 % ...subsumed : 430
% 0.54/0.53 % ...remaining for further processing : 566
% 0.54/0.53 % Other redundant clauses eliminated : 0
% 0.54/0.53 % Clauses deleted for lack of memory : 0
% 0.54/0.53 % Backward-subsumed : 32
% 0.54/0.53 % Backward-rewritten : 92
% 0.54/0.53 % Generated clauses : 6676
% 0.54/0.53 % ...of the previous two non-redundant : 5601
% 0.54/0.53 % ...aggressively subsumed : 0
% 0.54/0.53 % Contextual simplify-reflections : 12
% 0.54/0.53 % Paramodulations : 6492
% 0.54/0.53 % Factorizations : 184
% 0.54/0.53 % NegExts : 0
% 0.54/0.53 % Equation resolutions : 0
% 0.54/0.53 % Disequality decompositions : 0
% 0.54/0.53 % Total rewrite steps : 1261
% 0.54/0.53 % ...of those cached : 1190
% 0.54/0.53 % Propositional unsat checks : 0
% 0.54/0.53 % Propositional check models : 0
% 0.54/0.53 % Propositional check unsatisfiable : 0
% 0.54/0.53 % Propositional clauses : 0
% 0.54/0.53 % Propositional clauses after purity: 0
% 0.54/0.53 % Propositional unsat core size : 0
% 0.54/0.53 % Propositional preprocessing time : 0.000
% 0.54/0.53 % Propositional encoding time : 0.000
% 0.54/0.53 % Propositional solver time : 0.000
% 0.54/0.53 % Success case prop preproc time : 0.000
% 0.54/0.53 % Success case prop encoding time : 0.000
% 0.54/0.53 % Success case prop solver time : 0.000
% 0.54/0.53 % Current number of processed clauses : 396
% 0.54/0.53 % Positive orientable unit clauses : 48
% 0.54/0.53 % Positive unorientable unit clauses: 0
% 0.54/0.53 % Negative unit clauses : 8
% 0.54/0.53 % Non-unit-clauses : 340
% 0.54/0.53 % Current number of unprocessed clauses: 4423
% 0.54/0.53 % ...number of literals in the above : 20369
% 0.54/0.53 % Current number of archived formulas : 0
% 0.54/0.53 % Current number of archived clauses : 170
% 0.54/0.53 % Clause-clause subsumption calls (NU) : 42990
% 0.54/0.53 % Rec. Clause-clause subsumption calls : 16225
% 0.54/0.53 % Non-unit clause-clause subsumptions : 407
% 0.54/0.53 % Unit Clause-clause subsumption calls : 1978
% 0.54/0.53 % Rewrite failures with RHS unbound : 0
% 0.54/0.53 % BW rewrite match attempts : 83
% 0.54/0.53 % BW rewrite match successes : 13
% 0.54/0.53 % Condensation attempts : 0
% 0.54/0.53 % Condensation successes : 0
% 0.54/0.53 % Termbank termtop insertions : 96510
% 0.54/0.53 % Search garbage collected termcells : 508
% 0.54/0.53
% 0.54/0.53 % -------------------------------------------------
% 0.54/0.54 % User time : 0.084 s
% 0.54/0.54 % System time : 0.009 s
% 0.54/0.54 % Total time : 0.092 s
% 0.54/0.54 % Maximum resident set size: 3680 pages
% 0.54/0.54
% 0.54/0.54 % -------------------------------------------------
% 0.54/0.54 % User time : 0.471 s
% 0.54/0.54 % System time : 0.034 s
% 0.54/0.54 % Total time : 0.504 s
% 0.54/0.54 % Maximum resident set size: 4864 pages
% 0.54/0.54 % E exiting
%------------------------------------------------------------------------------