%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : GEO270+1 : TPTP v9.3.1. Released v4.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n001.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:03 PM UTC 2026
% Result : Theorem 2.08s 0.75s
% Output : CNFRefutation 2.08s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 6
% Syntax : Number of formulae : 37 ( 9 unt; 0 def)
% Number of atoms : 170 ( 108 equ)
% Maximal formula atoms : 8 ( 4 avg)
% Number of connectives : 210 ( 77 ~; 71 |; 43 &)
% ( 0 <=>; 19 =>; 0 <=; 0 <~>)
% Maximal formula depth : 15 ( 6 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 4 con; 0-6 aty)
% Number of variables : 98 ( 0 sgn 61 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof('and(pred(conjunct2(207), 4), and(holds(conjunct2(207), 1051, 0), and(pred(conjunct2(207), 1), and(pred(conjunct1(207), 2), pred(conjunct1(207), 1)))))',axiom,
( rpoint(vd1048)
& vd1047 = vd1048
& rpoint(vd1050)
& vd1047 != vd1049
& vd1049 = vd1050 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','and(pred(conjunct2(207), 4), and(holds(conjunct2(207), 1051, 0), and(pred(conjunct2(207), 1), and(pred(conjunct1(207), 2), pred(conjunct1(207), 1)))))') ).
fof('qe(208)',conjecture,
? [X1] :
( rpoint(X1)
& vf(vd1047,vd1049) = vf(vd1049,X1)
& vf(vd1049,X1) = vf(X1,vd1047) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','qe(208)') ).
fof('qu(cond(axiom(166), 0), imp(cond(axiom(166), 0)))',axiom,
! [X15,X16] :
( ( ? [X18] :
( rpoint(X18)
& X15 = X18 )
& ? [X17] :
( rpoint(X17)
& X16 = X17 ) )
=> vf(X15,X16) = vf(X16,X15) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','qu(cond(axiom(166), 0), imp(cond(axiom(166), 0)))') ).
fof('ass(cond(proof(209), 0), 3)',axiom,
! [X2,X3,X4,X5] :
( ( rpoint(X3)
& X2 = X3
& rpoint(X5)
& X2 != X4
& X4 = X5 )
=> ! [X6] :
( X6 = vskolem1061(X2,X3,X4,X5)
=> ! [X7] :
( X7 = vskolem1063(X6,X2,X3,X4,X5)
=> vf(X2,X4) = vf(X2,vskolem1064(X7,X6,X2,X3,X4,X5)) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','ass(cond(proof(209), 0), 3)') ).
fof('ass(cond(proof(209), 0), 1)',axiom,
! [X2,X3,X4,X5] :
( ( rpoint(X3)
& X2 = X3
& rpoint(X5)
& X2 != X4
& X4 = X5 )
=> ! [X6] :
( X6 = vskolem1061(X2,X3,X4,X5)
=> ! [X7] :
( X7 = vskolem1063(X6,X2,X3,X4,X5)
=> vf(X2,X4) = vf(X4,vskolem1064(X7,X6,X2,X3,X4,X5)) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','ass(cond(proof(209), 0), 1)') ).
fof('ass(cond(proof(209), 0), 6)',axiom,
! [X2,X3,X4,X5] :
( ( rpoint(X3)
& X2 = X3
& rpoint(X5)
& X2 != X4
& X4 = X5 )
=> ! [X6] :
( X6 = vskolem1061(X2,X3,X4,X5)
=> ! [X7] :
( X7 = vskolem1063(X6,X2,X3,X4,X5)
=> rpoint(vskolem1064(X7,X6,X2,X3,X4,X5)) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','ass(cond(proof(209), 0), 6)') ).
fof(c_0_6,plain,
( rpoint(vd1048)
& vd1047 = vd1048
& rpoint(vd1050)
& vd1047 != vd1049
& vd1049 = vd1050 ),
inference(fof_simplification,[status(thm)],['and(pred(conjunct2(207), 4), and(holds(conjunct2(207), 1051, 0), and(pred(conjunct2(207), 1), and(pred(conjunct1(207), 2), pred(conjunct1(207), 1)))))']) ).
fof(c_0_7,negated_conjecture,
~ ? [X1] :
( rpoint(X1)
& vf(vd1047,vd1049) = vf(vd1049,X1)
& vf(vd1049,X1) = vf(X1,vd1047) ),
inference(assume_negation,[status(cth)],['qe(208)']) ).
fof(c_0_8,plain,
! [X810,X811,X812,X813] :
( vf(X810,X811) = vf(X811,X810)
| ~ rpoint(X813)
| X810 != X813
| ~ rpoint(X812)
| X811 != X812 ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],['qu(cond(axiom(166), 0), imp(cond(axiom(166), 0)))'])])])]) ).
fof(c_0_9,plain,
( rpoint(vd1048)
& vd1047 = vd1048
& rpoint(vd1050)
& vd1047 != vd1049
& vd1049 = vd1050 ),
inference(fof_nnf,[status(thm)],[c_0_6]) ).
fof(c_0_10,plain,
! [X2,X3,X4,X5] :
( ( rpoint(X3)
& X2 = X3
& rpoint(X5)
& X2 != X4
& X4 = X5 )
=> ! [X6] :
( X6 = vskolem1061(X2,X3,X4,X5)
=> ! [X7] :
( X7 = vskolem1063(X6,X2,X3,X4,X5)
=> vf(X2,X4) = vf(X2,vskolem1064(X7,X6,X2,X3,X4,X5)) ) ) ),
inference(fof_simplification,[status(thm)],['ass(cond(proof(209), 0), 3)']) ).
fof(c_0_11,negated_conjecture,
! [X735] :
( ~ rpoint(X735)
| vf(vd1047,vd1049) != vf(vd1049,X735)
| vf(vd1049,X735) != vf(X735,vd1047) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_7])])]) ).
cnf(c_0_12,plain,
( ~ rpoint(X4)
| X3 != X4
| ~ rpoint(X2)
| X1 != X2
| vf(X3,X1) = vf(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_13,plain,
rpoint(vd1048),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_14,plain,
vd1047 = vd1048,
inference(split_conjunct,[status(thm)],[c_0_9]) ).
fof(c_0_15,plain,
! [X754,X755,X756,X757,X758,X759] :
( vf(X754,X756) = vf(X754,vskolem1064(X759,X758,X754,X755,X756,X757))
| X759 != vskolem1063(X758,X754,X755,X756,X757)
| X758 != vskolem1061(X754,X755,X756,X757)
| ~ rpoint(X755)
| X754 != X755
| ~ rpoint(X757)
| X754 = X756
| X756 != X757 ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_10])])])]) ).
fof(c_0_16,plain,
! [X2,X3,X4,X5] :
( ( rpoint(X3)
& X2 = X3
& rpoint(X5)
& X2 != X4
& X4 = X5 )
=> ! [X6] :
( X6 = vskolem1061(X2,X3,X4,X5)
=> ! [X7] :
( X7 = vskolem1063(X6,X2,X3,X4,X5)
=> vf(X2,X4) = vf(X4,vskolem1064(X7,X6,X2,X3,X4,X5)) ) ) ),
inference(fof_simplification,[status(thm)],['ass(cond(proof(209), 0), 1)']) ).
cnf(c_0_17,negated_conjecture,
( ~ rpoint(X1)
| vf(vd1047,vd1049) != vf(vd1049,X1)
| vf(vd1049,X1) != vf(X1,vd1047) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_18,plain,
( ~ rpoint(X1)
| ~ rpoint(X2)
| vf(X1,X2) = vf(X2,X1) ),
inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_12])]) ).
cnf(c_0_19,plain,
rpoint(vd1047),
inference(rw,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_20,plain,
( X6 != vskolem1063(X5,X3,X4,X1,X2)
| X5 != vskolem1061(X3,X4,X1,X2)
| ~ rpoint(X4)
| X3 != X4
| ~ rpoint(X2)
| X1 != X2
| vf(X3,X1) = vf(X3,vskolem1064(X6,X5,X3,X4,X1,X2))
| X3 = X1 ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
fof(c_0_21,plain,
! [X742,X743,X744,X745,X746,X747] :
( vf(X742,X744) = vf(X744,vskolem1064(X747,X746,X742,X743,X744,X745))
| X747 != vskolem1063(X746,X742,X743,X744,X745)
| X746 != vskolem1061(X742,X743,X744,X745)
| ~ rpoint(X743)
| X742 != X743
| ~ rpoint(X745)
| X742 = X744
| X744 != X745 ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_16])])])]) ).
fof(c_0_22,plain,
! [X2,X3,X4,X5] :
( ( rpoint(X3)
& X2 = X3
& rpoint(X5)
& X2 != X4
& X4 = X5 )
=> ! [X6] :
( X6 = vskolem1061(X2,X3,X4,X5)
=> ! [X7] :
( X7 = vskolem1063(X6,X2,X3,X4,X5)
=> rpoint(vskolem1064(X7,X6,X2,X3,X4,X5)) ) ) ),
inference(fof_simplification,[status(thm)],['ass(cond(proof(209), 0), 6)']) ).
cnf(c_0_23,negated_conjecture,
( ~ rpoint(X1)
| vf(vd1047,X1) != vf(vd1049,X1)
| vf(vd1047,vd1049) != vf(vd1049,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_19])]) ).
cnf(c_0_24,plain,
( ~ rpoint(X2)
| ~ rpoint(X1)
| X2 = X1
| vf(X1,vskolem1064(vskolem1063(vskolem1061(X1,X1,X2,X2),X1,X1,X2,X2),vskolem1061(X1,X1,X2,X2),X1,X1,X2,X2)) = vf(X1,X2) ),
inference(er,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_20])])])]) ).
cnf(c_0_25,plain,
( X6 != vskolem1063(X5,X3,X4,X1,X2)
| X5 != vskolem1061(X3,X4,X1,X2)
| ~ rpoint(X4)
| X3 != X4
| ~ rpoint(X2)
| X1 != X2
| vf(X3,X1) = vf(X1,vskolem1064(X6,X5,X3,X4,X1,X2))
| X3 = X1 ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_26,plain,
rpoint(vd1050),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_27,plain,
vd1049 = vd1050,
inference(split_conjunct,[status(thm)],[c_0_9]) ).
fof(c_0_28,plain,
! [X772,X773,X774,X775,X776,X777] :
( rpoint(vskolem1064(X777,X776,X772,X773,X774,X775))
| X777 != vskolem1063(X776,X772,X773,X774,X775)
| X776 != vskolem1061(X772,X773,X774,X775)
| ~ rpoint(X773)
| X772 != X773
| ~ rpoint(X775)
| X772 = X774
| X774 != X775 ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_22])])])]) ).
cnf(c_0_29,negated_conjecture,
( ~ rpoint(X1)
| ~ rpoint(vskolem1064(vskolem1063(vskolem1061(vd1047,vd1047,X1,X1),vd1047,vd1047,X1,X1),vskolem1061(vd1047,vd1047,X1,X1),vd1047,vd1047,X1,X1))
| vf(vd1049,vskolem1064(vskolem1063(vskolem1061(vd1047,vd1047,X1,X1),vd1047,vd1047,X1,X1),vskolem1061(vd1047,vd1047,X1,X1),vd1047,vd1047,X1,X1)) != vf(vd1047,X1)
| vf(vd1049,vskolem1064(vskolem1063(vskolem1061(vd1047,vd1047,X1,X1),vd1047,vd1047,X1,X1),vskolem1061(vd1047,vd1047,X1,X1),vd1047,vd1047,X1,X1)) != vf(vd1047,vd1049)
| X1 = vd1047 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_19])]) ).
cnf(c_0_30,plain,
( ~ rpoint(X1)
| ~ rpoint(X2)
| X1 = X2
| vf(X1,vskolem1064(vskolem1063(vskolem1061(X2,X2,X1,X1),X2,X2,X1,X1),vskolem1061(X2,X2,X1,X1),X2,X2,X1,X1)) = vf(X2,X1) ),
inference(er,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_25])])])]) ).
cnf(c_0_31,plain,
rpoint(vd1049),
inference(rw,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_32,plain,
vd1047 != vd1049,
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_33,plain,
( X6 != vskolem1063(X5,X3,X4,X1,X2)
| X5 != vskolem1061(X3,X4,X1,X2)
| ~ rpoint(X4)
| X3 != X4
| ~ rpoint(X2)
| X1 != X2
| rpoint(vskolem1064(X6,X5,X3,X4,X1,X2))
| X3 = X1 ),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
cnf(c_0_34,negated_conjecture,
~ rpoint(vskolem1064(vskolem1063(vskolem1061(vd1047,vd1047,vd1049,vd1049),vd1047,vd1047,vd1049,vd1049),vskolem1061(vd1047,vd1047,vd1049,vd1049),vd1047,vd1047,vd1049,vd1049)),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_31]),c_0_19])]),c_0_32]) ).
cnf(c_0_35,plain,
( ~ rpoint(X1)
| ~ rpoint(X2)
| rpoint(vskolem1064(vskolem1063(vskolem1061(X2,X2,X1,X1),X2,X2,X1,X1),vskolem1061(X2,X2,X1,X1),X2,X2,X1,X1))
| X1 = X2 ),
inference(er,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_33])])])]) ).
cnf(c_0_36,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_19]),c_0_31])]),c_0_32]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : GEO270+1 : TPTP v9.3.1. Released v4.1.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.36 % Computer : n001.cluster.edu
% 0.10/0.36 % Model : x86_64 x86_64
% 0.10/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36 % Memory : 8046.5625MB
% 0.10/0.36 % OS : Linux 6.8.0-71-generic
% 0.10/0.36 % CPULimit : 300
% 0.10/0.36 % WCLimit : 300
% 0.10/0.36 % DateTime : Sun Sep 20 15:09:43 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.37 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.41 Running first-order theorem proving
% 0.10/0.41 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
% 2.08/0.75 % Version: 3.5.1
% 2.08/0.75 % Preprocessing class: FSLSSMSMSSSNFFN.
% 2.08/0.75 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.08/0.75 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 2.08/0.75 % Starting new_bool_3 with 300s (1) cores
% 2.08/0.75 % Starting new_bool_1 with 300s (1) cores
% 2.08/0.75 % Starting sh5l with 300s (1) cores
% 2.08/0.75 % C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 863183 completed with status 0
% 2.08/0.75 % Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 2.08/0.75 % Preprocessing class: FSLSSMSMSSSNFFN.
% 2.08/0.75 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.08/0.75 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 2.08/0.75 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 2.08/0.75 % No SInE strategy applied
% 2.08/0.75 % Search class: FGHSF-FSLM33-SFFFFFNN
% 2.08/0.75 % Scheduled 11 strats onto 5 cores with 1500 seconds (1500 total)
% 2.08/0.75 % Starting SubtermCWHack with 136s (1) cores
% 2.08/0.75 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 2.08/0.75 % Starting G-E--_302_C18_F1_URBAN_S0Y with 136s (1) cores
% 2.08/0.75 % Starting H----_102_C18_F1_PI_AE_CS_SP_PS_S0Y with 136s (1) cores
% 2.08/0.75 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with 136s (1) cores
% 2.08/0.75 % G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with pid 863193 completed with status 0
% 2.08/0.75 % Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d
% 2.08/0.75 % Preprocessing class: FSLSSMSMSSSNFFN.
% 2.08/0.75 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.08/0.75 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 2.08/0.75 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 2.08/0.75 % No SInE strategy applied
% 2.08/0.75 % Search class: FGHSF-FSLM33-SFFFFFNN
% 2.08/0.75 % Scheduled 11 strats onto 5 cores with 1500 seconds (1500 total)
% 2.08/0.75 % Starting SubtermCWHack with 136s (1) cores
% 2.08/0.75 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 2.08/0.75 % Starting G-E--_302_C18_F1_URBAN_S0Y with 136s (1) cores
% 2.08/0.75 % Starting H----_102_C18_F1_PI_AE_CS_SP_PS_S0Y with 136s (1) cores
% 2.08/0.75 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with 136s (1) cores
% 2.08/0.75 % Preprocessing time : 0.015 s
% 2.08/0.75 % Presaturation interreduction done
% 2.08/0.75
% 2.08/0.75 % Proof found!
% 2.08/0.75 % SZS status Theorem
% 2.08/0.75 % SZS output start CNFRefutation
% See solution above
% 2.08/0.75 % Parsed axioms : 116
% 2.08/0.75 % Removed by relevancy pruning/SinE : 0
% 2.08/0.75 % Initial clauses : 270
% 2.08/0.75 % Removed in clause preprocessing : 2
% 2.08/0.75 % Initial clauses in saturation : 268
% 2.08/0.75 % Processed clauses : 949
% 2.08/0.75 % ...of these trivial : 0
% 2.08/0.75 % ...subsumed : 142
% 2.08/0.75 % ...remaining for further processing : 807
% 2.08/0.75 % Other redundant clauses eliminated : 1151
% 2.08/0.75 % Clauses deleted for lack of memory : 0
% 2.08/0.75 % Backward-subsumed : 2
% 2.08/0.75 % Backward-rewritten : 0
% 2.08/0.75 % Generated clauses : 1036
% 2.08/0.75 % ...of the previous two non-redundant : 994
% 2.08/0.75 % ...aggressively subsumed : 0
% 2.08/0.75 % Contextual simplify-reflections : 25
% 2.08/0.75 % Paramodulations : 771
% 2.08/0.75 % Factorizations : 8
% 2.08/0.75 % NegExts : 0
% 2.08/0.75 % Equation resolutions : 1152
% 2.08/0.75 % Disequality decompositions : 0
% 2.08/0.75 % Total rewrite steps : 59
% 2.08/0.75 % ...of those cached : 53
% 2.08/0.75 % Propositional unsat checks : 0
% 2.08/0.75 % Propositional check models : 0
% 2.08/0.75 % Propositional check unsatisfiable : 0
% 2.08/0.75 % Propositional clauses : 0
% 2.08/0.75 % Propositional clauses after purity: 0
% 2.08/0.75 % Propositional unsat core size : 0
% 2.08/0.75 % Propositional preprocessing time : 0.000
% 2.08/0.75 % Propositional encoding time : 0.000
% 2.08/0.75 % Propositional solver time : 0.000
% 2.08/0.75 % Success case prop preproc time : 0.000
% 2.08/0.75 % Success case prop encoding time : 0.000
% 2.08/0.75 % Success case prop solver time : 0.000
% 2.08/0.75 % Current number of processed clauses : 285
% 2.08/0.75 % Positive orientable unit clauses : 7
% 2.08/0.75 % Positive unorientable unit clauses: 0
% 2.08/0.75 % Negative unit clauses : 7
% 2.08/0.75 % Non-unit-clauses : 271
% 2.08/0.75 % Current number of unprocessed clauses: 578
% 2.08/0.75 % ...number of literals in the above : 5495
% 2.08/0.75 % Current number of archived formulas : 0
% 2.08/0.75 % Current number of archived clauses : 268
% 2.08/0.75 % Clause-clause subsumption calls (NU) : 381751
% 2.08/0.75 % Rec. Clause-clause subsumption calls : 10176
% 2.08/0.75 % Non-unit clause-clause subsumptions : 163
% 2.08/0.75 % Unit Clause-clause subsumption calls : 35
% 2.08/0.75 % Rewrite failures with RHS unbound : 0
% 2.08/0.75 % BW rewrite match attempts : 0
% 2.08/0.75 % BW rewrite match successes : 0
% 2.08/0.75 % Condensation attempts : 0
% 2.08/0.75 % Condensation successes : 0
% 2.08/0.75 % Termbank termtop insertions : 89368
% 2.08/0.75 % Search garbage collected termcells : 14366
% 2.08/0.75
% 2.08/0.75 % -------------------------------------------------
% 2.08/0.75 % User time : 0.295 s
% 2.08/0.75 % System time : 0.011 s
% 2.08/0.75 % Total time : 0.306 s
% 2.08/0.75 % Maximum resident set size: 6264 pages
% 2.08/0.75
% 2.08/0.75 % -------------------------------------------------
% 2.08/0.75 % User time : 1.300 s
% 2.08/0.75 % System time : 0.054 s
% 2.08/0.75 % Total time : 1.355 s
% 2.08/0.75 % Maximum resident set size: 5376 pages
% 2.08/0.75 % E exiting
%------------------------------------------------------------------------------