%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : GEO202+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 : n002.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.15s 0.72s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 12
% Syntax : Number of formulae : 65 ( 26 unt; 0 def)
% Number of atoms : 139 ( 0 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 120 ( 46 ~; 55 |; 8 &)
% ( 0 <=>; 11 =>; 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 : 6 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 110 ( 3 sgn 66 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(con,conjecture,
! [X1,X2,X3] :
( ( convergent_lines(line_connecting(X1,X2),line_connecting(X1,X3))
& distinct_points(X1,X3)
& distinct_points(X1,X2) )
=> equal_points(intersection_point(line_connecting(X1,X2),line_connecting(X1,X3)),X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',con) ).
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(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(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(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(apart3,axiom,
! [X1] : ~ convergent_lines(X1,X1),
file('/export/starexec/sandbox2/benchmark/Axioms/GEO006+0.ax',apart3) ).
fof(ceq2,axiom,
! [X1,X2,X3] :
( apart_point_and_line(X1,X2)
=> ( apart_point_and_line(X1,X3)
| distinct_lines(X2,X3) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/GEO006+0.ax',ceq2) ).
fof(p1,axiom,
! [X1,X2] :
( distinct_lines(X1,X2)
=> convergent_lines(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/GEO006+1.ax',p1) ).
fof(cp1,axiom,
! [X1,X2] : ~ convergent_lines(parallel_through_point(X2,X1),X2),
file('/export/starexec/sandbox2/benchmark/Axioms/GEO006+2.ax',cp1) ).
fof(cp2,axiom,
! [X1,X2] : ~ apart_point_and_line(X1,parallel_through_point(X2,X1)),
file('/export/starexec/sandbox2/benchmark/Axioms/GEO006+2.ax',cp2) ).
fof(c_0_12,negated_conjecture,
~ ! [X1,X2,X3] :
( ( convergent_lines(line_connecting(X1,X2),line_connecting(X1,X3))
& distinct_points(X1,X3)
& distinct_points(X1,X2) )
=> equal_points(intersection_point(line_connecting(X1,X2),line_connecting(X1,X3)),X1) ),
inference(assume_negation,[status(cth)],[con]) ).
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_points(intersection_point(line_connecting(esk1_0,esk2_0),line_connecting(esk1_0,esk3_0)),esk1_0)
& convergent_lines(line_connecting(esk1_0,esk2_0),line_connecting(esk1_0,esk3_0))
& distinct_points(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_15,plain,
! [X1] : ~ distinct_points(X1,X1),
inference(fof_simplification,[status(thm)],[apart1]) ).
cnf(c_0_16,plain,
( ~ distinct_points(X1,X2)
| distinct_points(X2,X3)
| distinct_points(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_17,negated_conjecture,
distinct_points(esk1_0,esk3_0),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
fof(c_0_18,plain,
! [X11] : ~ distinct_points(X11,X11),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_15])]) ).
cnf(c_0_19,negated_conjecture,
( distinct_points(esk3_0,X1)
| distinct_points(esk1_0,X1) ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_20,plain,
~ distinct_points(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_21,negated_conjecture,
( distinct_points(X1,X2)
| distinct_points(esk3_0,X2)
| distinct_points(esk1_0,X1) ),
inference(spm,[status(thm)],[c_0_16,c_0_19]) ).
fof(c_0_22,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_23,negated_conjecture,
( distinct_points(esk1_0,X1)
| distinct_points(X1,esk3_0) ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
fof(c_0_24,plain,
! [X1,X2] :
( distinct_points(X1,X2)
=> ~ apart_point_and_line(X2,line_connecting(X1,X2)) ),
inference(fof_simplification,[status(thm)],[ci2]) ).
fof(c_0_25,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_26,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_27,plain,
( ~ convergent_lines(X1,X2)
| convergent_lines(X1,X3)
| distinct_lines(X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_28,negated_conjecture,
convergent_lines(line_connecting(esk1_0,esk2_0),line_connecting(esk1_0,esk3_0)),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_29,negated_conjecture,
( distinct_points(X1,X2)
| distinct_points(esk1_0,X2)
| distinct_points(X1,esk3_0) ),
inference(spm,[status(thm)],[c_0_16,c_0_23]) ).
fof(c_0_30,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_24])])]) ).
fof(c_0_31,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_25])])]) ).
fof(c_0_32,plain,
! [X1] : ~ convergent_lines(X1,X1),
inference(fof_simplification,[status(thm)],[apart3]) ).
cnf(c_0_33,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_26]) ).
cnf(c_0_34,negated_conjecture,
( distinct_lines(line_connecting(esk1_0,esk3_0),X1)
| convergent_lines(line_connecting(esk1_0,esk2_0),X1) ),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_35,negated_conjecture,
( distinct_points(X1,esk3_0)
| distinct_points(X1,esk1_0) ),
inference(spm,[status(thm)],[c_0_20,c_0_29]) ).
cnf(c_0_36,plain,
( ~ apart_point_and_line(X2,line_connecting(X1,X2))
| ~ distinct_points(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
cnf(c_0_37,plain,
( ~ apart_point_and_line(X1,line_connecting(X1,X2))
| ~ distinct_points(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_31]) ).
fof(c_0_38,plain,
! [X13] : ~ convergent_lines(X13,X13),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_32])]) ).
cnf(c_0_39,negated_conjecture,
( ~ distinct_points(X1,X2)
| convergent_lines(line_connecting(esk1_0,esk2_0),X3)
| apart_point_and_line(X2,X3)
| apart_point_and_line(X1,X3)
| apart_point_and_line(X2,line_connecting(esk1_0,esk3_0))
| apart_point_and_line(X1,line_connecting(esk1_0,esk3_0)) ),
inference(spm,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_40,negated_conjecture,
distinct_points(esk3_0,esk1_0),
inference(spm,[status(thm)],[c_0_20,c_0_35]) ).
cnf(c_0_41,negated_conjecture,
~ apart_point_and_line(esk3_0,line_connecting(esk1_0,esk3_0)),
inference(spm,[status(thm)],[c_0_36,c_0_17]) ).
cnf(c_0_42,negated_conjecture,
~ apart_point_and_line(esk1_0,line_connecting(esk1_0,esk3_0)),
inference(spm,[status(thm)],[c_0_37,c_0_17]) ).
cnf(c_0_43,negated_conjecture,
distinct_points(esk1_0,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
fof(c_0_44,plain,
! [X38,X39,X40] :
( apart_point_and_line(X38,X40)
| distinct_lines(X39,X40)
| ~ apart_point_and_line(X38,X39) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ceq2])])]) ).
cnf(c_0_45,plain,
~ convergent_lines(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_38]) ).
cnf(c_0_46,negated_conjecture,
( convergent_lines(line_connecting(esk1_0,esk2_0),X1)
| apart_point_and_line(esk3_0,X1)
| apart_point_and_line(esk1_0,X1) ),
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_40]),c_0_41]),c_0_42]) ).
cnf(c_0_47,negated_conjecture,
~ apart_point_and_line(esk1_0,line_connecting(esk1_0,esk2_0)),
inference(spm,[status(thm)],[c_0_37,c_0_43]) ).
fof(c_0_48,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_49,plain,
( ~ apart_point_and_line(X1,X2)
| apart_point_and_line(X1,X3)
| distinct_lines(X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_44]) ).
cnf(c_0_50,negated_conjecture,
apart_point_and_line(esk3_0,line_connecting(esk1_0,esk2_0)),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_46]),c_0_47]) ).
cnf(c_0_51,plain,
( ~ distinct_lines(X1,X2)
| convergent_lines(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_48]) ).
cnf(c_0_52,negated_conjecture,
( distinct_lines(line_connecting(esk1_0,esk2_0),X1)
| apart_point_and_line(esk3_0,X1) ),
inference(spm,[status(thm)],[c_0_49,c_0_50]) ).
cnf(c_0_53,negated_conjecture,
( convergent_lines(line_connecting(esk1_0,esk2_0),X1)
| apart_point_and_line(esk3_0,X1) ),
inference(spm,[status(thm)],[c_0_51,c_0_52]) ).
fof(c_0_54,plain,
! [X1,X2] : ~ convergent_lines(parallel_through_point(X2,X1),X2),
inference(fof_simplification,[status(thm)],[cp1]) ).
cnf(c_0_55,negated_conjecture,
( distinct_lines(X1,X2)
| convergent_lines(line_connecting(esk1_0,esk2_0),X2)
| apart_point_and_line(esk3_0,X1) ),
inference(spm,[status(thm)],[c_0_27,c_0_53]) ).
fof(c_0_56,plain,
! [X1,X2] : ~ apart_point_and_line(X1,parallel_through_point(X2,X1)),
inference(fof_simplification,[status(thm)],[cp2]) ).
fof(c_0_57,plain,
! [X46,X47] : ~ convergent_lines(parallel_through_point(X47,X46),X47),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_54])]) ).
cnf(c_0_58,negated_conjecture,
( distinct_lines(X1,line_connecting(esk1_0,esk2_0))
| apart_point_and_line(esk3_0,X1) ),
inference(spm,[status(thm)],[c_0_45,c_0_55]) ).
fof(c_0_59,plain,
! [X48,X49] : ~ apart_point_and_line(X48,parallel_through_point(X49,X48)),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_56])]) ).
cnf(c_0_60,plain,
~ convergent_lines(parallel_through_point(X1,X2),X1),
inference(split_conjunct,[status(thm)],[c_0_57]) ).
cnf(c_0_61,negated_conjecture,
( convergent_lines(X1,line_connecting(esk1_0,esk2_0))
| apart_point_and_line(esk3_0,X1) ),
inference(spm,[status(thm)],[c_0_51,c_0_58]) ).
cnf(c_0_62,plain,
~ apart_point_and_line(X1,parallel_through_point(X2,X1)),
inference(split_conjunct,[status(thm)],[c_0_59]) ).
cnf(c_0_63,negated_conjecture,
apart_point_and_line(esk3_0,parallel_through_point(line_connecting(esk1_0,esk2_0),X1)),
inference(spm,[status(thm)],[c_0_60,c_0_61]) ).
cnf(c_0_64,negated_conjecture,
$false,
inference(spm,[status(thm)],[c_0_62,c_0_63]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : GEO202+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.10/0.55 % Computer : n002.cluster.edu
% 0.10/0.55 % Model : x86_64 x86_64
% 0.10/0.55 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.55 % Memory : 8046.5625MB
% 0.10/0.55 % OS : Linux 6.8.0-71-generic
% 0.10/0.55 % CPULimit : 300
% 0.10/0.55 % WCLimit : 300
% 0.10/0.55 % DateTime : Sun Sep 20 13:29:33 UTC 2026
% 0.10/0.55 % CPUTime :
% 0.10/0.55 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.15/0.59 Running first-order theorem proving
% 0.15/0.59 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.15/0.72 % Version: 3.5.1
% 0.15/0.72 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/0.72 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.72 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/0.72 % Starting new_bool_3 with 300s (1) cores
% 0.15/0.72 % Starting new_bool_1 with 300s (1) cores
% 0.15/0.72 % Starting sh5l with 300s (1) cores
% 0.15/0.72 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 1072298 completed with status 0
% 0.15/0.72 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.15/0.72 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/0.72 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.72 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/0.72 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.15/0.72 % No SInE strategy applied
% 0.15/0.72 % Search class: FGHNF-FFMS22-SFFFFFNN
% 0.15/0.72 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.15/0.72 % Starting SubtermCWHack with 136s (1) cores
% 0.15/0.72 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.15/0.72 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.15/0.72 % Starting new_bool_3 with 136s (1) cores
% 0.15/0.72 % Starting new_bool_1 with 136s (1) cores
% 0.15/0.72 % new_bool_1 with pid 1072306 completed with status 0
% 0.15/0.72 % Result found by new_bool_1
% 0.15/0.72 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/0.72 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.72 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/0.72 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.15/0.72 % No SInE strategy applied
% 0.15/0.72 % Search class: FGHNF-FFMS22-SFFFFFNN
% 0.15/0.72 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.15/0.72 % Starting SubtermCWHack with 136s (1) cores
% 0.15/0.72 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.15/0.72 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.15/0.72 % Starting new_bool_3 with 136s (1) cores
% 0.15/0.72 % Starting new_bool_1 with 136s (1) cores
% 0.15/0.72 % Preprocessing time : 0.001 s
% 0.15/0.72 % Presaturation interreduction done
% 0.15/0.72
% 0.15/0.72 % Proof found!
% 0.15/0.72 % SZS status Theorem
% 0.15/0.72 % SZS output start CNFRefutation
% See solution above
% 0.15/0.72 % Parsed axioms : 36
% 0.15/0.72 % Removed by relevancy pruning/SinE : 0
% 0.15/0.72 % Initial clauses : 50
% 0.15/0.72 % Removed in clause preprocessing : 0
% 0.15/0.72 % Initial clauses in saturation : 50
% 0.15/0.72 % Processed clauses : 1199
% 0.15/0.72 % ...of these trivial : 54
% 0.15/0.72 % ...subsumed : 363
% 0.15/0.72 % ...remaining for further processing : 782
% 0.15/0.72 % Other redundant clauses eliminated : 0
% 0.15/0.72 % Clauses deleted for lack of memory : 0
% 0.15/0.72 % Backward-subsumed : 10
% 0.15/0.72 % Backward-rewritten : 4
% 0.15/0.72 % Generated clauses : 6206
% 0.15/0.72 % ...of the previous two non-redundant : 5484
% 0.15/0.72 % ...aggressively subsumed : 0
% 0.15/0.72 % Contextual simplify-reflections : 0
% 0.15/0.72 % Paramodulations : 5852
% 0.15/0.72 % Factorizations : 354
% 0.15/0.72 % NegExts : 0
% 0.15/0.72 % Equation resolutions : 0
% 0.15/0.72 % Disequality decompositions : 0
% 0.15/0.72 % Total rewrite steps : 857
% 0.15/0.72 % ...of those cached : 793
% 0.15/0.72 % Propositional unsat checks : 0
% 0.15/0.72 % Propositional check models : 0
% 0.15/0.72 % Propositional check unsatisfiable : 0
% 0.15/0.72 % Propositional clauses : 0
% 0.15/0.72 % Propositional clauses after purity: 0
% 0.15/0.72 % Propositional unsat core size : 0
% 0.15/0.72 % Propositional preprocessing time : 0.000
% 0.15/0.72 % Propositional encoding time : 0.000
% 0.15/0.72 % Propositional solver time : 0.000
% 0.15/0.72 % Success case prop preproc time : 0.000
% 0.15/0.72 % Success case prop encoding time : 0.000
% 0.15/0.72 % Success case prop solver time : 0.000
% 0.15/0.72 % Current number of processed clauses : 722
% 0.15/0.72 % Positive orientable unit clauses : 40
% 0.15/0.72 % Positive unorientable unit clauses: 0
% 0.15/0.72 % Negative unit clauses : 36
% 0.15/0.72 % Non-unit-clauses : 646
% 0.15/0.72 % Current number of unprocessed clauses: 4371
% 0.15/0.72 % ...number of literals in the above : 23406
% 0.15/0.72 % Current number of archived formulas : 0
% 0.15/0.72 % Current number of archived clauses : 60
% 0.15/0.72 % Clause-clause subsumption calls (NU) : 73649
% 0.15/0.72 % Rec. Clause-clause subsumption calls : 33625
% 0.15/0.72 % Non-unit clause-clause subsumptions : 352
% 0.15/0.72 % Unit Clause-clause subsumption calls : 2477
% 0.15/0.72 % Rewrite failures with RHS unbound : 0
% 0.15/0.72 % BW rewrite match attempts : 47
% 0.15/0.72 % BW rewrite match successes : 3
% 0.15/0.72 % Condensation attempts : 0
% 0.15/0.72 % Condensation successes : 0
% 0.15/0.72 % Termbank termtop insertions : 99517
% 0.15/0.72 % Search garbage collected termcells : 508
% 0.15/0.72
% 0.15/0.72 % -------------------------------------------------
% 0.15/0.72 % User time : 0.100 s
% 0.15/0.72 % System time : 0.008 s
% 0.15/0.72 % Total time : 0.108 s
% 0.15/0.72 % Maximum resident set size: 3680 pages
% 0.15/0.72
% 0.15/0.72 % -------------------------------------------------
% 0.15/0.72 % User time : 0.511 s
% 0.15/0.72 % System time : 0.030 s
% 0.15/0.72 % Total time : 0.540 s
% 0.15/0.72 % Maximum resident set size: 4608 pages
% 0.15/0.72 % E exiting
%------------------------------------------------------------------------------