%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : GEO191+3 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n008.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:29:35 PM UTC 2026
% Result : Theorem 10.19s 6.89s
% Output : CNFRefutation 10.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 13
% Syntax : Number of formulae : 65 ( 24 unt; 0 def)
% Number of atoms : 155 ( 0 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 139 ( 49 ~; 69 |; 9 &)
% ( 0 <=>; 12 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 4 con; 0-2 aty)
% Number of variables : 119 ( 6 sgn 74 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(con,conjecture,
! [X1,X2,X4,X5] :
( ( ( apart_point_and_line(intersection_point(X1,X2),X5)
| apart_point_and_line(intersection_point(X1,X2),X4) )
& convergent_lines(X4,X5)
& convergent_lines(X1,X2) )
=> ( apart_point_and_line(intersection_point(X4,X5),X2)
| apart_point_and_line(intersection_point(X4,X5),X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',con) ).
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/sandbox/benchmark/Axioms/GEO006+0.ax',ceq2) ).
fof(ci4,axiom,
! [X1,X2] :
( convergent_lines(X1,X2)
=> ~ apart_point_and_line(intersection_point(X1,X2),X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/GEO006+0.ax',ci4) ).
fof(ceq1,axiom,
! [X1,X2,X3] :
( apart_point_and_line(X1,X2)
=> ( apart_point_and_line(X3,X2)
| distinct_points(X1,X3) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/GEO006+0.ax',ceq1) ).
fof(ceq3,axiom,
! [X1,X2,X3] :
( convergent_lines(X1,X2)
=> ( convergent_lines(X1,X3)
| distinct_lines(X2,X3) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/GEO006+0.ax',ceq3) ).
fof(apart2,axiom,
! [X1] : ~ distinct_lines(X1,X1),
file('/export/starexec/sandbox/benchmark/Axioms/GEO006+0.ax',apart2) ).
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/sandbox/benchmark/Axioms/GEO006+0.ax',cu1) ).
fof(ci3,axiom,
! [X1,X2] :
( convergent_lines(X1,X2)
=> ~ apart_point_and_line(intersection_point(X1,X2),X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/GEO006+0.ax',ci3) ).
fof(apart3,axiom,
! [X1] : ~ convergent_lines(X1,X1),
file('/export/starexec/sandbox/benchmark/Axioms/GEO006+0.ax',apart3) ).
fof(cp2,axiom,
! [X1,X2] : ~ apart_point_and_line(X1,parallel_through_point(X2,X1)),
file('/export/starexec/sandbox/benchmark/Axioms/GEO006+2.ax',cp2) ).
fof(p1,axiom,
! [X1,X2] :
( distinct_lines(X1,X2)
=> convergent_lines(X1,X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/GEO006+1.ax',p1) ).
fof(cp1,axiom,
! [X1,X2] : ~ convergent_lines(parallel_through_point(X2,X1),X2),
file('/export/starexec/sandbox/benchmark/Axioms/GEO006+2.ax',cp1) ).
fof(ax6,axiom,
! [X1,X2,X3] :
( convergent_lines(X1,X2)
=> ( convergent_lines(X2,X3)
| convergent_lines(X1,X3) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/GEO006+0.ax',ax6) ).
fof(c_0_13,negated_conjecture,
~ ! [X1,X2,X4,X5] :
( ( ( apart_point_and_line(intersection_point(X1,X2),X5)
| apart_point_and_line(intersection_point(X1,X2),X4) )
& convergent_lines(X4,X5)
& convergent_lines(X1,X2) )
=> ( apart_point_and_line(intersection_point(X4,X5),X2)
| apart_point_and_line(intersection_point(X4,X5),X1) ) ),
inference(assume_negation,[status(cth)],[con]) ).
fof(c_0_14,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])])]) ).
fof(c_0_15,negated_conjecture,
( ~ apart_point_and_line(intersection_point(esk3_0,esk4_0),esk2_0)
& ~ apart_point_and_line(intersection_point(esk3_0,esk4_0),esk1_0)
& ( apart_point_and_line(intersection_point(esk1_0,esk2_0),esk4_0)
| apart_point_and_line(intersection_point(esk1_0,esk2_0),esk3_0) )
& convergent_lines(esk3_0,esk4_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_13])])])]) ).
fof(c_0_16,plain,
! [X1,X2] :
( convergent_lines(X1,X2)
=> ~ apart_point_and_line(intersection_point(X1,X2),X2) ),
inference(fof_simplification,[status(thm)],[ci4]) ).
fof(c_0_17,plain,
! [X35,X36,X37] :
( apart_point_and_line(X37,X36)
| distinct_points(X35,X37)
| ~ apart_point_and_line(X35,X36) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ceq1])])]) ).
cnf(c_0_18,plain,
( ~ apart_point_and_line(X1,X2)
| apart_point_and_line(X1,X3)
| distinct_lines(X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_19,negated_conjecture,
( apart_point_and_line(intersection_point(esk1_0,esk2_0),esk4_0)
| apart_point_and_line(intersection_point(esk1_0,esk2_0),esk3_0) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
fof(c_0_20,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])])]) ).
fof(c_0_21,plain,
! [X29,X30] :
( ~ apart_point_and_line(intersection_point(X29,X30),X30)
| ~ convergent_lines(X29,X30) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_16])])]) ).
cnf(c_0_22,plain,
( ~ apart_point_and_line(X1,X2)
| apart_point_and_line(X3,X2)
| distinct_points(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_23,negated_conjecture,
( distinct_lines(esk4_0,X1)
| apart_point_and_line(intersection_point(esk1_0,esk2_0),X1)
| apart_point_and_line(intersection_point(esk1_0,esk2_0),esk3_0) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
fof(c_0_24,plain,
! [X1] : ~ distinct_lines(X1,X1),
inference(fof_simplification,[status(thm)],[apart2]) ).
fof(c_0_25,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_26,plain,
( ~ convergent_lines(X1,X2)
| convergent_lines(X1,X3)
| distinct_lines(X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_27,negated_conjecture,
convergent_lines(esk1_0,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_28,plain,
( ~ apart_point_and_line(intersection_point(X1,X2),X2)
| ~ convergent_lines(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_29,negated_conjecture,
( distinct_points(intersection_point(esk1_0,esk2_0),X1)
| distinct_lines(esk4_0,X2)
| apart_point_and_line(X1,X2)
| apart_point_and_line(intersection_point(esk1_0,esk2_0),esk3_0) ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
fof(c_0_30,plain,
! [X12] : ~ distinct_lines(X12,X12),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_24])]) ).
fof(c_0_31,plain,
! [X1,X2] :
( convergent_lines(X1,X2)
=> ~ apart_point_and_line(intersection_point(X1,X2),X1) ),
inference(fof_simplification,[status(thm)],[ci3]) ).
cnf(c_0_32,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_25]) ).
cnf(c_0_33,negated_conjecture,
( distinct_lines(esk2_0,X1)
| convergent_lines(esk1_0,X1) ),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_34,negated_conjecture,
( ~ convergent_lines(X2,X1)
| distinct_points(intersection_point(esk1_0,esk2_0),intersection_point(X2,X1))
| distinct_lines(esk4_0,X1)
| apart_point_and_line(intersection_point(esk1_0,esk2_0),esk3_0) ),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_35,negated_conjecture,
convergent_lines(esk3_0,esk4_0),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_36,plain,
~ distinct_lines(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
fof(c_0_37,plain,
! [X1] : ~ convergent_lines(X1,X1),
inference(fof_simplification,[status(thm)],[apart3]) ).
fof(c_0_38,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_31])])]) ).
cnf(c_0_39,negated_conjecture,
( ~ distinct_points(X1,X2)
| convergent_lines(esk1_0,X3)
| apart_point_and_line(X2,X3)
| apart_point_and_line(X1,X3)
| apart_point_and_line(X2,esk2_0)
| apart_point_and_line(X1,esk2_0) ),
inference(spm,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_40,negated_conjecture,
( distinct_points(intersection_point(esk1_0,esk2_0),intersection_point(esk3_0,esk4_0))
| apart_point_and_line(intersection_point(esk1_0,esk2_0),esk3_0) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_36]) ).
cnf(c_0_41,negated_conjecture,
~ apart_point_and_line(intersection_point(esk3_0,esk4_0),esk2_0),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
fof(c_0_42,plain,
! [X13] : ~ convergent_lines(X13,X13),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_37])]) ).
cnf(c_0_43,plain,
( ~ apart_point_and_line(intersection_point(X1,X2),X1)
| ~ convergent_lines(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_38]) ).
cnf(c_0_44,negated_conjecture,
( convergent_lines(esk1_0,X1)
| apart_point_and_line(intersection_point(esk1_0,esk2_0),X1)
| apart_point_and_line(intersection_point(esk3_0,esk4_0),X1)
| apart_point_and_line(intersection_point(esk1_0,esk2_0),esk2_0)
| apart_point_and_line(intersection_point(esk1_0,esk2_0),esk3_0) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_40]),c_0_41]) ).
cnf(c_0_45,negated_conjecture,
~ apart_point_and_line(intersection_point(esk3_0,esk4_0),esk1_0),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_46,plain,
~ convergent_lines(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_42]) ).
fof(c_0_47,plain,
! [X1,X2] : ~ apart_point_and_line(X1,parallel_through_point(X2,X1)),
inference(fof_simplification,[status(thm)],[cp2]) ).
cnf(c_0_48,negated_conjecture,
( apart_point_and_line(intersection_point(esk1_0,esk2_0),esk3_0)
| apart_point_and_line(intersection_point(esk1_0,esk2_0),esk2_0) ),
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_44]),c_0_27])]),c_0_45]),c_0_46]) ).
fof(c_0_49,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_47])]) ).
cnf(c_0_50,negated_conjecture,
( distinct_lines(esk3_0,X1)
| apart_point_and_line(intersection_point(esk1_0,esk2_0),X1)
| apart_point_and_line(intersection_point(esk1_0,esk2_0),esk2_0) ),
inference(spm,[status(thm)],[c_0_18,c_0_48]) ).
fof(c_0_51,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_52,plain,
~ apart_point_and_line(X1,parallel_through_point(X2,X1)),
inference(split_conjunct,[status(thm)],[c_0_49]) ).
cnf(c_0_53,negated_conjecture,
( distinct_lines(esk3_0,X1)
| apart_point_and_line(intersection_point(esk1_0,esk2_0),X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_50]),c_0_27])]) ).
fof(c_0_54,plain,
! [X1,X2] : ~ convergent_lines(parallel_through_point(X2,X1),X2),
inference(fof_simplification,[status(thm)],[cp1]) ).
fof(c_0_55,plain,
! [X20,X21,X22] :
( convergent_lines(X21,X22)
| convergent_lines(X20,X22)
| ~ convergent_lines(X20,X21) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax6])])]) ).
cnf(c_0_56,plain,
( ~ distinct_lines(X1,X2)
| convergent_lines(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_51]) ).
cnf(c_0_57,negated_conjecture,
distinct_lines(esk3_0,parallel_through_point(X1,intersection_point(esk1_0,esk2_0))),
inference(spm,[status(thm)],[c_0_52,c_0_53]) ).
fof(c_0_58,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_59,plain,
( ~ convergent_lines(X1,X2)
| convergent_lines(X2,X3)
| convergent_lines(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_55]) ).
cnf(c_0_60,negated_conjecture,
convergent_lines(esk3_0,parallel_through_point(X1,intersection_point(esk1_0,esk2_0))),
inference(spm,[status(thm)],[c_0_56,c_0_57]) ).
cnf(c_0_61,plain,
~ convergent_lines(parallel_through_point(X1,X2),X1),
inference(split_conjunct,[status(thm)],[c_0_58]) ).
cnf(c_0_62,negated_conjecture,
( convergent_lines(esk3_0,X2)
| convergent_lines(parallel_through_point(X1,intersection_point(esk1_0,esk2_0)),X2) ),
inference(spm,[status(thm)],[c_0_59,c_0_60]) ).
cnf(c_0_63,negated_conjecture,
convergent_lines(esk3_0,X1),
inference(spm,[status(thm)],[c_0_61,c_0_62]) ).
cnf(c_0_64,negated_conjecture,
$false,
inference(spm,[status(thm)],[c_0_46,c_0_63]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : GEO191+3 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/5.40 % Computer : n008.cluster.edu
% 0.10/5.40 % Model : x86_64 x86_64
% 0.10/5.40 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/5.40 % Memory : 8046.5625MB
% 0.10/5.40 % OS : Linux 6.8.0-71-generic
% 0.02/5.40 % CPULimit : 300
% 0.02/5.40 % WCLimit : 300
% 0.02/5.40 % DateTime : Sun Sep 20 13:14:44 UTC 2026
% 0.02/5.40 % CPUTime :
% 0.02/5.40 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.02/5.47 Running first-order theorem proving
% 0.02/5.47 Running: /export/starexec/sandbox/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/sandbox/benchmark/theBenchmark.p
% 10.19/6.89 % Version: 3.5.1
% 10.19/6.89 % Preprocessing class: FSMSSMSSSSSNFFN.
% 10.19/6.89 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 10.19/6.89 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 10.19/6.89 % Starting new_bool_3 with 300s (1) cores
% 10.19/6.89 % Starting new_bool_1 with 300s (1) cores
% 10.19/6.89 % Starting sh5l with 300s (1) cores
% 10.19/6.89 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 2989345 completed with status 0
% 10.19/6.89 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 10.19/6.89 % Preprocessing class: FSMSSMSSSSSNFFN.
% 10.19/6.89 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 10.19/6.89 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 10.19/6.89 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 10.19/6.89 % No SInE strategy applied
% 10.19/6.89 % Search class: FGHNF-FFMS22-SFFFFFNN
% 10.19/6.89 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 10.19/6.89 % Starting SubtermCWHack with 136s (1) cores
% 10.19/6.89 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 10.19/6.89 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 10.19/6.89 % Starting new_bool_3 with 136s (1) cores
% 10.19/6.89 % Starting new_bool_1 with 136s (1) cores
% 10.19/6.89 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 2989350 completed with status 0
% 10.19/6.89 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 10.19/6.89 % Preprocessing class: FSMSSMSSSSSNFFN.
% 10.19/6.89 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 10.19/6.89 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 10.19/6.89 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 10.19/6.89 % No SInE strategy applied
% 10.19/6.89 % Search class: FGHNF-FFMS22-SFFFFFNN
% 10.19/6.89 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 10.19/6.89 % Starting SubtermCWHack with 136s (1) cores
% 10.19/6.89 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 10.19/6.89 % Preprocessing time : 0.003 s
% 10.19/6.89 % Presaturation interreduction done
% 10.19/6.89
% 10.19/6.89 % Proof found!
% 10.19/6.89 % SZS status Theorem
% 10.19/6.89 % SZS output start CNFRefutation
% See solution above
% 10.19/6.89 % Parsed axioms : 36
% 10.19/6.89 % Removed by relevancy pruning/SinE : 0
% 10.19/6.89 % Initial clauses : 51
% 10.19/6.89 % Removed in clause preprocessing : 0
% 10.19/6.89 % Initial clauses in saturation : 51
% 10.19/6.89 % Processed clauses : 2680
% 10.19/6.89 % ...of these trivial : 23
% 10.19/6.89 % ...subsumed : 1217
% 10.19/6.89 % ...remaining for further processing : 1440
% 10.19/6.89 % Other redundant clauses eliminated : 0
% 10.19/6.89 % Clauses deleted for lack of memory : 0
% 10.19/6.89 % Backward-subsumed : 328
% 10.19/6.89 % Backward-rewritten : 295
% 10.19/6.89 % Generated clauses : 34282
% 10.19/6.89 % ...of the previous two non-redundant : 27226
% 10.19/6.89 % ...aggressively subsumed : 0
% 10.19/6.89 % Contextual simplify-reflections : 58
% 10.19/6.89 % Paramodulations : 33760
% 10.19/6.89 % Factorizations : 522
% 10.19/6.89 % NegExts : 0
% 10.19/6.89 % Equation resolutions : 0
% 10.19/6.89 % Disequality decompositions : 0
% 10.19/6.89 % Total rewrite steps : 8085
% 10.19/6.89 % ...of those cached : 7903
% 10.19/6.89 % Propositional unsat checks : 0
% 10.19/6.89 % Propositional check models : 0
% 10.19/6.89 % Propositional check unsatisfiable : 0
% 10.19/6.89 % Propositional clauses : 0
% 10.19/6.89 % Propositional clauses after purity: 0
% 10.19/6.89 % Propositional unsat core size : 0
% 10.19/6.89 % Propositional preprocessing time : 0.000
% 10.19/6.89 % Propositional encoding time : 0.000
% 10.19/6.89 % Propositional solver time : 0.000
% 10.19/6.89 % Success case prop preproc time : 0.000
% 10.19/6.89 % Success case prop encoding time : 0.000
% 10.19/6.89 % Success case prop solver time : 0.000
% 10.19/6.89 % Current number of processed clauses : 770
% 10.19/6.89 % Positive orientable unit clauses : 64
% 10.19/6.89 % Positive unorientable unit clauses: 0
% 10.19/6.89 % Negative unit clauses : 9
% 10.19/6.89 % Non-unit-clauses : 697
% 10.19/6.89 % Current number of unprocessed clauses: 24011
% 10.19/6.89 % ...number of literals in the above : 124713
% 10.19/6.89 % Current number of archived formulas : 0
% 10.19/6.89 % Current number of archived clauses : 670
% 10.19/6.89 % Clause-clause subsumption calls (NU) : 318483
% 10.19/6.89 % Rec. Clause-clause subsumption calls : 59019
% 10.19/6.89 % Non-unit clause-clause subsumptions : 1496
% 10.19/6.89 % Unit Clause-clause subsumption calls : 8902
% 10.19/6.89 % Rewrite failures with RHS unbound : 0
% 10.19/6.89 % BW rewrite match attempts : 120
% 10.19/6.89 % BW rewrite match successes : 43
% 10.19/6.89 % Condensation attempts : 0
% 10.19/6.89 % Condensation successes : 0
% 10.19/6.89 % Termbank termtop insertions : 497997
% 10.19/6.89 % Search garbage collected termcells : 533
% 10.19/6.89
% 10.19/6.89 % -------------------------------------------------
% 10.19/6.89 % User time : 1.206 s
% 10.19/6.89 % System time : 0.042 s
% 10.19/6.89 % Total time : 1.248 s
% 10.19/6.89 % Maximum resident set size: 3680 pages
% 10.19/6.89
% 10.19/6.89 % -------------------------------------------------
% 10.19/6.89 % User time : 6.385 s
% 10.19/6.89 % System time : 0.210 s
% 10.19/6.89 % Total time : 6.595 s
% 10.19/6.89 % Maximum resident set size: 4608 pages
% 10.19/6.89 % E exiting
%------------------------------------------------------------------------------