TSTP Solution File: SWW384+1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SWW384+1 : TPTP v8.2.0. Released v5.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n009.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Tue May 21 06:42:32 EDT 2024
% Result : ContradictoryAxioms 30.34s 5.30s
% Output : CNFRefutation 30.34s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 12
% Syntax : Number of formulae : 46 ( 30 unt; 0 def)
% Number of atoms : 83 ( 18 equ)
% Maximal formula atoms : 10 ( 1 avg)
% Number of connectives : 66 ( 29 ~; 25 |; 4 &)
% ( 3 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 3 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 16 ( 16 usr; 3 con; 0-3 aty)
% Number of variables : 104 ( 11 sgn 59 !; 1 ?)
% Comments :
%------------------------------------------------------------------------------
fof(fact_Collect__mem__eq,axiom,
! [X15,X5] : hAPP(c_Set_OCollect(X5),hAPP(hAPP(c_COMBC(X5,tc_fun(X5,tc_HOL_Obool),tc_HOL_Obool),c_member(X5)),X15)) = X15,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_Collect__mem__eq) ).
fof(fact_Collect__def,axiom,
! [X33,X5] : hAPP(c_Set_OCollect(X5),X33) = X33,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_Collect__def) ).
fof(fact_not__less__iff__gr__or__eq,axiom,
! [X20,X16,X5] :
( class_Orderings_Olinorder(X5)
=> ( ~ hBOOL(hAPP(hAPP(c_Orderings_Oord__class_Oless(X5),X16),X20))
<=> ( hBOOL(hAPP(hAPP(c_Orderings_Oord__class_Oless(X5),X20),X16))
| X16 = X20 ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_not__less__iff__gr__or__eq) ).
fof(help_c__COMBC__1,axiom,
! [X31,X32,X33,X5,X22,X13] : hAPP(hAPP(hAPP(c_COMBC(X13,X22,X5),X33),X32),X31) = hAPP(hAPP(X33,X31),X32),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',help_c__COMBC__1) ).
fof(fact_lessI,axiom,
! [X93] : hBOOL(hAPP(hAPP(c_Orderings_Oord__class_Oless(tc_Nat_Onat),X93),hAPP(c_Nat_OSuc,X93))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_lessI) ).
fof(fact_finite__nat__set__iff__bounded,axiom,
! [X65] :
( hBOOL(hAPP(c_Finite__Set_Ofinite(tc_Nat_Onat),X65))
<=> ? [X127] :
! [X3] :
( hBOOL(hAPP(hAPP(c_member(tc_Nat_Onat),X3),X65))
=> hBOOL(hAPP(hAPP(c_Orderings_Oord__class_Oless(tc_Nat_Onat),X3),X127)) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_finite__nat__set__iff__bounded) ).
fof(arity_Nat__Onat__Orderings_Olinorder,axiom,
class_Orderings_Olinorder(tc_Nat_Onat),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',arity_Nat__Onat__Orderings_Olinorder) ).
fof(fact_rangeI,axiom,
! [X13,X16,X2,X5] : hBOOL(hAPP(hAPP(c_member(X5),hAPP(X2,X16)),hAPP(c_Set_Oimage(X13,X5,X2),c_Orderings_Otop__class_Otop(tc_fun(X13,tc_HOL_Obool))))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_rangeI) ).
fof(fact_finite__set,axiom,
! [X252,X5] : hBOOL(hAPP(c_Finite__Set_Ofinite(X5),hAPP(c_List_Oset(X5),X252))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_finite__set) ).
fof(fact_UNIV__enum,axiom,
! [X5] :
( class_Enum_Oenum(X5)
=> c_Orderings_Otop__class_Otop(tc_fun(X5,tc_HOL_Obool)) = hAPP(c_List_Oset(X5),c_Enum_Oenum__class_Oenum(X5)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_UNIV__enum) ).
fof(fact_finite__imageI,axiom,
! [X12,X13,X14,X5] :
( hBOOL(hAPP(c_Finite__Set_Ofinite(X5),X14))
=> hBOOL(hAPP(c_Finite__Set_Ofinite(X13),hAPP(c_Set_Oimage(X5,X13,X12),X14))) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_finite__imageI) ).
fof(arity_HOL__Obool__Enum_Oenum,axiom,
class_Enum_Oenum(tc_HOL_Obool),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',arity_HOL__Obool__Enum_Oenum) ).
fof(c_0_12,plain,
! [X2284,X2285] : hAPP(c_Set_OCollect(X2285),hAPP(hAPP(c_COMBC(X2285,tc_fun(X2285,tc_HOL_Obool),tc_HOL_Obool),c_member(X2285)),X2284)) = X2284,
inference(variable_rename,[status(thm)],[fact_Collect__mem__eq]) ).
fof(c_0_13,plain,
! [X2282,X2283] : hAPP(c_Set_OCollect(X2283),X2282) = X2282,
inference(variable_rename,[status(thm)],[fact_Collect__def]) ).
fof(c_0_14,plain,
! [X20,X16,X5] :
( class_Orderings_Olinorder(X5)
=> ( ~ hBOOL(hAPP(hAPP(c_Orderings_Oord__class_Oless(X5),X16),X20))
<=> ( hBOOL(hAPP(hAPP(c_Orderings_Oord__class_Oless(X5),X20),X16))
| X16 = X20 ) ) ),
inference(fof_simplification,[status(thm)],[fact_not__less__iff__gr__or__eq]) ).
fof(c_0_15,plain,
! [X1902,X1903,X1904,X1905,X1906,X1907] : hAPP(hAPP(hAPP(c_COMBC(X1907,X1906,X1905),X1904),X1903),X1902) = hAPP(hAPP(X1904,X1902),X1903),
inference(variable_rename,[status(thm)],[help_c__COMBC__1]) ).
cnf(c_0_16,plain,
hAPP(c_Set_OCollect(X1),hAPP(hAPP(c_COMBC(X1,tc_fun(X1,tc_HOL_Obool),tc_HOL_Obool),c_member(X1)),X2)) = X2,
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_17,plain,
hAPP(c_Set_OCollect(X1),X2) = X2,
inference(split_conjunct,[status(thm)],[c_0_13]) ).
fof(c_0_18,plain,
! [X6629,X6630,X6631] :
( ( hBOOL(hAPP(hAPP(c_Orderings_Oord__class_Oless(X6631),X6630),X6629))
| hBOOL(hAPP(hAPP(c_Orderings_Oord__class_Oless(X6631),X6629),X6630))
| X6630 = X6629
| ~ class_Orderings_Olinorder(X6631) )
& ( ~ hBOOL(hAPP(hAPP(c_Orderings_Oord__class_Oless(X6631),X6629),X6630))
| ~ hBOOL(hAPP(hAPP(c_Orderings_Oord__class_Oless(X6631),X6630),X6629))
| ~ class_Orderings_Olinorder(X6631) )
& ( X6630 != X6629
| ~ hBOOL(hAPP(hAPP(c_Orderings_Oord__class_Oless(X6631),X6630),X6629))
| ~ class_Orderings_Olinorder(X6631) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_14])])])]) ).
fof(c_0_19,plain,
! [X4975] : hBOOL(hAPP(hAPP(c_Orderings_Oord__class_Oless(tc_Nat_Onat),X4975),hAPP(c_Nat_OSuc,X4975))),
inference(variable_rename,[status(thm)],[fact_lessI]) ).
fof(c_0_20,plain,
! [X373,X375,X376,X377] :
( ( ~ hBOOL(hAPP(c_Finite__Set_Ofinite(tc_Nat_Onat),X373))
| ~ hBOOL(hAPP(hAPP(c_member(tc_Nat_Onat),X375),X373))
| hBOOL(hAPP(hAPP(c_Orderings_Oord__class_Oless(tc_Nat_Onat),X375),esk8_1(X373))) )
& ( hBOOL(hAPP(hAPP(c_member(tc_Nat_Onat),esk9_2(X376,X377)),X376))
| hBOOL(hAPP(c_Finite__Set_Ofinite(tc_Nat_Onat),X376)) )
& ( ~ hBOOL(hAPP(hAPP(c_Orderings_Oord__class_Oless(tc_Nat_Onat),esk9_2(X376,X377)),X377))
| hBOOL(hAPP(c_Finite__Set_Ofinite(tc_Nat_Onat),X376)) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[fact_finite__nat__set__iff__bounded])])])])])])]) ).
cnf(c_0_21,plain,
hAPP(hAPP(hAPP(c_COMBC(X1,X2,X3),X4),X5),X6) = hAPP(hAPP(X4,X6),X5),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_22,plain,
hAPP(hAPP(c_COMBC(X1,tc_fun(X1,tc_HOL_Obool),tc_HOL_Obool),c_member(X1)),X2) = X2,
inference(rw,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_23,plain,
( ~ hBOOL(hAPP(hAPP(c_Orderings_Oord__class_Oless(X1),X2),X3))
| ~ hBOOL(hAPP(hAPP(c_Orderings_Oord__class_Oless(X1),X3),X2))
| ~ class_Orderings_Olinorder(X1) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_24,plain,
hBOOL(hAPP(hAPP(c_Orderings_Oord__class_Oless(tc_Nat_Onat),X1),hAPP(c_Nat_OSuc,X1))),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_25,plain,
class_Orderings_Olinorder(tc_Nat_Onat),
inference(split_conjunct,[status(thm)],[arity_Nat__Onat__Orderings_Olinorder]) ).
cnf(c_0_26,plain,
( hBOOL(hAPP(hAPP(c_Orderings_Oord__class_Oless(tc_Nat_Onat),X2),esk8_1(X1)))
| ~ hBOOL(hAPP(c_Finite__Set_Ofinite(tc_Nat_Onat),X1))
| ~ hBOOL(hAPP(hAPP(c_member(tc_Nat_Onat),X2),X1)) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_27,plain,
hAPP(hAPP(c_member(X1),X2),X3) = hAPP(X3,X2),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
fof(c_0_28,plain,
! [X668,X669,X670,X671] : hBOOL(hAPP(hAPP(c_member(X671),hAPP(X670,X669)),hAPP(c_Set_Oimage(X668,X671,X670),c_Orderings_Otop__class_Otop(tc_fun(X668,tc_HOL_Obool))))),
inference(variable_rename,[status(thm)],[fact_rangeI]) ).
fof(c_0_29,plain,
! [X2590,X2591] : hBOOL(hAPP(c_Finite__Set_Ofinite(X2591),hAPP(c_List_Oset(X2591),X2590))),
inference(variable_rename,[status(thm)],[fact_finite__set]) ).
fof(c_0_30,plain,
! [X3214] :
( ~ class_Enum_Oenum(X3214)
| c_Orderings_Otop__class_Otop(tc_fun(X3214,tc_HOL_Obool)) = hAPP(c_List_Oset(X3214),c_Enum_Oenum__class_Oenum(X3214)) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fact_UNIV__enum])])]) ).
cnf(c_0_31,plain,
~ hBOOL(hAPP(hAPP(c_Orderings_Oord__class_Oless(tc_Nat_Onat),hAPP(c_Nat_OSuc,X1)),X1)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_25])]) ).
cnf(c_0_32,plain,
( hBOOL(hAPP(hAPP(c_Orderings_Oord__class_Oless(tc_Nat_Onat),X1),esk8_1(X2)))
| ~ hBOOL(hAPP(c_Finite__Set_Ofinite(tc_Nat_Onat),X2))
| ~ hBOOL(hAPP(X2,X1)) ),
inference(rw,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_33,plain,
hBOOL(hAPP(hAPP(c_member(X1),hAPP(X2,X3)),hAPP(c_Set_Oimage(X4,X1,X2),c_Orderings_Otop__class_Otop(tc_fun(X4,tc_HOL_Obool))))),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
cnf(c_0_34,plain,
hBOOL(hAPP(c_Finite__Set_Ofinite(X1),hAPP(c_List_Oset(X1),X2))),
inference(split_conjunct,[status(thm)],[c_0_29]) ).
cnf(c_0_35,plain,
( c_Orderings_Otop__class_Otop(tc_fun(X1,tc_HOL_Obool)) = hAPP(c_List_Oset(X1),c_Enum_Oenum__class_Oenum(X1))
| ~ class_Enum_Oenum(X1) ),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
cnf(c_0_36,plain,
( ~ hBOOL(hAPP(X1,hAPP(c_Nat_OSuc,esk8_1(X1))))
| ~ hBOOL(hAPP(c_Finite__Set_Ofinite(tc_Nat_Onat),X1)) ),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_37,plain,
hBOOL(hAPP(hAPP(c_Set_Oimage(X1,X2,X3),c_Orderings_Otop__class_Otop(tc_fun(X1,tc_HOL_Obool))),hAPP(X3,X4))),
inference(rw,[status(thm)],[c_0_33,c_0_27]) ).
fof(c_0_38,plain,
! [X566,X567,X568,X569] :
( ~ hBOOL(hAPP(c_Finite__Set_Ofinite(X569),X568))
| hBOOL(hAPP(c_Finite__Set_Ofinite(X567),hAPP(c_Set_Oimage(X569,X567,X566),X568))) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fact_finite__imageI])])]) ).
cnf(c_0_39,plain,
( hBOOL(hAPP(c_Finite__Set_Ofinite(X1),c_Orderings_Otop__class_Otop(tc_fun(X1,tc_HOL_Obool))))
| ~ class_Enum_Oenum(X1) ),
inference(spm,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_40,plain,
class_Enum_Oenum(tc_HOL_Obool),
inference(split_conjunct,[status(thm)],[arity_HOL__Obool__Enum_Oenum]) ).
cnf(c_0_41,plain,
~ hBOOL(hAPP(c_Finite__Set_Ofinite(tc_Nat_Onat),hAPP(c_Set_Oimage(X1,X2,c_Nat_OSuc),c_Orderings_Otop__class_Otop(tc_fun(X1,tc_HOL_Obool))))),
inference(spm,[status(thm)],[c_0_36,c_0_37]) ).
cnf(c_0_42,plain,
( hBOOL(hAPP(c_Finite__Set_Ofinite(X3),hAPP(c_Set_Oimage(X1,X3,X4),X2)))
| ~ hBOOL(hAPP(c_Finite__Set_Ofinite(X1),X2)) ),
inference(split_conjunct,[status(thm)],[c_0_38]) ).
cnf(c_0_43,plain,
hBOOL(hAPP(c_Finite__Set_Ofinite(tc_HOL_Obool),c_Orderings_Otop__class_Otop(tc_fun(tc_HOL_Obool,tc_HOL_Obool)))),
inference(spm,[status(thm)],[c_0_39,c_0_40]) ).
cnf(c_0_44,plain,
~ hBOOL(hAPP(c_Finite__Set_Ofinite(X1),c_Orderings_Otop__class_Otop(tc_fun(X1,tc_HOL_Obool)))),
inference(spm,[status(thm)],[c_0_41,c_0_42]) ).
cnf(c_0_45,plain,
$false,
inference(sr,[status(thm)],[c_0_43,c_0_44]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SWW384+1 : TPTP v8.2.0. Released v5.2.0.
% 0.11/0.13 % Command : run_E %s %d THM
% 0.13/0.34 % Computer : n009.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Sat May 18 20:02:38 EDT 2024
% 0.13/0.34 % CPUTime :
% 0.19/0.46 Running first-order theorem proving
% 0.19/0.46 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
% 30.34/5.30 # Version: 3.1.0
% 30.34/5.30 # Preprocessing class: FMLMSLSMSSSNFFN.
% 30.34/5.30 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 30.34/5.30 # Starting SAT001_MinMin_p005000_rr_RG with 1500s (5) cores
% 30.34/5.30 # Starting new_bool_3 with 300s (1) cores
% 30.34/5.30 # Starting new_bool_1 with 300s (1) cores
% 30.34/5.30 # Starting sh5l with 300s (1) cores
% 30.34/5.30 # new_bool_1 with pid 30754 completed with status 0
% 30.34/5.30 # Result found by new_bool_1
% 30.34/5.30 # Preprocessing class: FMLMSLSMSSSNFFN.
% 30.34/5.30 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 30.34/5.30 # Starting SAT001_MinMin_p005000_rr_RG with 1500s (5) cores
% 30.34/5.30 # Starting new_bool_3 with 300s (1) cores
% 30.34/5.30 # Starting new_bool_1 with 300s (1) cores
% 30.34/5.30 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 30.34/5.30 # Search class: FGHSM-SMLM33-DFFFFFNN
% 30.34/5.30 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 30.34/5.30 # Starting SAT001_MinMin_p005000_rr with 163s (1) cores
% 30.34/5.30 # SAT001_MinMin_p005000_rr with pid 30763 completed with status 0
% 30.34/5.30 # Result found by SAT001_MinMin_p005000_rr
% 30.34/5.30 # Preprocessing class: FMLMSLSMSSSNFFN.
% 30.34/5.30 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 30.34/5.30 # Starting SAT001_MinMin_p005000_rr_RG with 1500s (5) cores
% 30.34/5.30 # Starting new_bool_3 with 300s (1) cores
% 30.34/5.30 # Starting new_bool_1 with 300s (1) cores
% 30.34/5.30 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 30.34/5.30 # Search class: FGHSM-SMLM33-DFFFFFNN
% 30.34/5.30 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 30.34/5.30 # Starting SAT001_MinMin_p005000_rr with 163s (1) cores
% 30.34/5.30 # Preprocessing time : 0.062 s
% 30.34/5.30 # Presaturation interreduction done
% 30.34/5.30
% 30.34/5.30 # Proof found!
% 30.34/5.30 # SZS status ContradictoryAxioms
% 30.34/5.30 # SZS output start CNFRefutation
% See solution above
% 30.34/5.30 # Parsed axioms : 5250
% 30.34/5.30 # Removed by relevancy pruning/SinE : 3250
% 30.34/5.30 # Initial clauses : 3050
% 30.34/5.30 # Removed in clause preprocessing : 86
% 30.34/5.30 # Initial clauses in saturation : 2964
% 30.34/5.30 # Processed clauses : 13593
% 30.34/5.30 # ...of these trivial : 424
% 30.34/5.30 # ...subsumed : 6608
% 30.34/5.30 # ...remaining for further processing : 6561
% 30.34/5.30 # Other redundant clauses eliminated : 1341
% 30.34/5.30 # Clauses deleted for lack of memory : 0
% 30.34/5.30 # Backward-subsumed : 151
% 30.34/5.30 # Backward-rewritten : 539
% 30.34/5.30 # Generated clauses : 132612
% 30.34/5.30 # ...of the previous two non-redundant : 126055
% 30.34/5.30 # ...aggressively subsumed : 0
% 30.34/5.30 # Contextual simplify-reflections : 16
% 30.34/5.30 # Paramodulations : 131156
% 30.34/5.30 # Factorizations : 10
% 30.34/5.30 # NegExts : 0
% 30.34/5.30 # Equation resolutions : 1478
% 30.34/5.30 # Disequality decompositions : 0
% 30.34/5.30 # Total rewrite steps : 42283
% 30.34/5.30 # ...of those cached : 34349
% 30.34/5.30 # Propositional unsat checks : 1
% 30.34/5.30 # Propositional check models : 0
% 30.34/5.30 # Propositional check unsatisfiable : 0
% 30.34/5.30 # Propositional clauses : 0
% 30.34/5.30 # Propositional clauses after purity: 0
% 30.34/5.30 # Propositional unsat core size : 0
% 30.34/5.30 # Propositional preprocessing time : 0.000
% 30.34/5.30 # Propositional encoding time : 0.103
% 30.34/5.30 # Propositional solver time : 0.075
% 30.34/5.30 # Success case prop preproc time : 0.000
% 30.34/5.30 # Success case prop encoding time : 0.000
% 30.34/5.30 # Success case prop solver time : 0.000
% 30.34/5.30 # Current number of processed clauses : 3403
% 30.34/5.30 # Positive orientable unit clauses : 728
% 30.34/5.30 # Positive unorientable unit clauses: 54
% 30.34/5.30 # Negative unit clauses : 561
% 30.34/5.30 # Non-unit-clauses : 2060
% 30.34/5.30 # Current number of unprocessed clauses: 107314
% 30.34/5.30 # ...number of literals in the above : 257970
% 30.34/5.30 # Current number of archived formulas : 0
% 30.34/5.30 # Current number of archived clauses : 2906
% 30.34/5.30 # Clause-clause subsumption calls (NU) : 941623
% 30.34/5.30 # Rec. Clause-clause subsumption calls : 582878
% 30.34/5.30 # Non-unit clause-clause subsumptions : 3198
% 30.34/5.30 # Unit Clause-clause subsumption calls : 79990
% 30.34/5.30 # Rewrite failures with RHS unbound : 284
% 30.34/5.30 # BW rewrite match attempts : 14810
% 30.34/5.30 # BW rewrite match successes : 905
% 30.34/5.30 # Condensation attempts : 0
% 30.34/5.30 # Condensation successes : 0
% 30.34/5.30 # Termbank termtop insertions : 3727940
% 30.34/5.30 # Search garbage collected termcells : 68924
% 30.34/5.30
% 30.34/5.30 # -------------------------------------------------
% 30.34/5.30 # User time : 4.217 s
% 30.34/5.30 # System time : 0.169 s
% 30.34/5.30 # Total time : 4.386 s
% 30.34/5.30 # Maximum resident set size: 18080 pages
% 30.34/5.30
% 30.34/5.30 # -------------------------------------------------
% 30.34/5.30 # User time : 4.458 s
% 30.34/5.30 # System time : 0.182 s
% 30.34/5.30 # Total time : 4.640 s
% 30.34/5.30 # Maximum resident set size: 9448 pages
% 30.34/5.30 % E---3.1 exiting
% 30.75/5.30 % E exiting
%------------------------------------------------------------------------------