TSTP Solution File: ITP020_5 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : ITP020_5 : TPTP v8.1.2. Bugfixed v7.5.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n031.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 : Sat May 4 08:09:03 EDT 2024
% Result : Timeout 287.63s 42.33s
% Output : None
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 19
% Syntax : Number of formulae : 37 ( 12 unt; 13 typ; 0 def)
% Number of atoms : 64 ( 3 equ)
% Maximal formula atoms : 13 ( 2 avg)
% Number of connectives : 73 ( 33 ~; 28 |; 6 &)
% ( 2 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 5 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of types : 3 ( 1 usr)
% Number of type conns : 20 ( 10 >; 10 *; 0 +; 0 <<)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 2 con; 0-4 aty)
% Number of variables : 44 ( 0 sgn 41 !; 3 ?; 23 :)
% Comments :
%------------------------------------------------------------------------------
tff(decl_sort1,type,
del: $tType ).
tff(decl_22,type,
bool: del ).
tff(decl_24,type,
arr: ( del * del ) > del ).
tff(decl_25,type,
mem: ( $i * del ) > $o ).
tff(decl_26,type,
ap: ( $i * $i ) > $i ).
tff(decl_29,type,
p: $i > $o ).
tff(decl_187,type,
ty_2Enum_2Enum: del ).
tff(decl_321,type,
ty_2Epair_2Eprod: ( del * del ) > del ).
tff(decl_691,type,
c_2Epred__set_2EBIJ: ( del * del ) > $i ).
tff(decl_695,type,
c_2Epred__set_2ECROSS: ( del * del ) > $i ).
tff(decl_727,type,
c_2Epred__set_2EUNIV: del > $i ).
tff(decl_3033,type,
c_2Ecardinal_2Ecardeq: ( del * del ) > $i ).
tff(decl_6464,type,
esk95_4: ( del * del * $i * $i ) > $i ).
tff(conj_thm_2Eutil__prob_2ENUM__2D__BIJ__INV,conjecture,
? [X22] :
( mem(X22,arr(ty_2Enum_2Enum,ty_2Epair_2Eprod(ty_2Enum_2Enum,ty_2Enum_2Enum)))
& p(ap(ap(ap(c_2Epred__set_2EBIJ(ty_2Enum_2Enum,ty_2Epair_2Eprod(ty_2Enum_2Enum,ty_2Enum_2Enum)),X22),c_2Epred__set_2EUNIV(ty_2Enum_2Enum)),ap(ap(c_2Epred__set_2ECROSS(ty_2Enum_2Enum,ty_2Enum_2Enum),c_2Epred__set_2EUNIV(ty_2Enum_2Enum)),c_2Epred__set_2EUNIV(ty_2Enum_2Enum)))) ),
file('/export/starexec/sandbox2/tmp/tmp.08E8Gc0ojN/E---3.1_9243.p',conj_thm_2Eutil__prob_2ENUM__2D__BIJ__INV) ).
tff(conj_thm_2Epred__set_2ECROSS__UNIV,axiom,
! [X11: del,X14: del] : ( c_2Epred__set_2EUNIV(ty_2Epair_2Eprod(X11,X14)) = ap(ap(c_2Epred__set_2ECROSS(X11,X14),c_2Epred__set_2EUNIV(X11)),c_2Epred__set_2EUNIV(X14)) ),
file('/export/starexec/sandbox2/tmp/tmp.08E8Gc0ojN/E---3.1_9243.p',conj_thm_2Epred__set_2ECROSS__UNIV) ).
tff(conj_thm_2Ecardinal_2Ecardeq__SYM,axiom,
! [X11: del,X14: del,X324] :
( mem(X324,arr(X11,bool))
=> ! [X55] :
( mem(X55,arr(X14,bool))
=> ( p(ap(ap(c_2Ecardinal_2Ecardeq(X11,X14),X324),X55))
<=> p(ap(ap(c_2Ecardinal_2Ecardeq(X14,X11),X55),X324)) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.08E8Gc0ojN/E---3.1_9243.p',conj_thm_2Ecardinal_2Ecardeq__SYM) ).
tff(conj_thm_2Ecardinal_2ECARD__SQUARE__NUM,axiom,
p(ap(ap(c_2Ecardinal_2Ecardeq(ty_2Epair_2Eprod(ty_2Enum_2Enum,ty_2Enum_2Enum),ty_2Enum_2Enum),ap(ap(c_2Epred__set_2ECROSS(ty_2Enum_2Enum,ty_2Enum_2Enum),c_2Epred__set_2EUNIV(ty_2Enum_2Enum)),c_2Epred__set_2EUNIV(ty_2Enum_2Enum))),c_2Epred__set_2EUNIV(ty_2Enum_2Enum))),
file('/export/starexec/sandbox2/tmp/tmp.08E8Gc0ojN/E---3.1_9243.p',conj_thm_2Ecardinal_2ECARD__SQUARE__NUM) ).
tff(mem_c_2Epred__set_2EUNIV,axiom,
! [X11: del] : mem(c_2Epred__set_2EUNIV(X11),arr(X11,bool)),
file('/export/starexec/sandbox2/tmp/tmp.08E8Gc0ojN/E---3.1_9243.p',mem_c_2Epred__set_2EUNIV) ).
tff(ax_thm_2Ecardinal_2Ecardeq__def,axiom,
! [X11: del,X14: del,X2003] :
( mem(X2003,arr(X11,bool))
=> ! [X2004] :
( mem(X2004,arr(X14,bool))
=> ( p(ap(ap(c_2Ecardinal_2Ecardeq(X11,X14),X2003),X2004))
<=> ? [X121] :
( mem(X121,arr(X11,X14))
& p(ap(ap(ap(c_2Epred__set_2EBIJ(X11,X14),X121),X2003),X2004)) ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.08E8Gc0ojN/E---3.1_9243.p',ax_thm_2Ecardinal_2Ecardeq__def) ).
tff(c_0_6,negated_conjecture,
~ ? [X22] :
( mem(X22,arr(ty_2Enum_2Enum,ty_2Epair_2Eprod(ty_2Enum_2Enum,ty_2Enum_2Enum)))
& p(ap(ap(ap(c_2Epred__set_2EBIJ(ty_2Enum_2Enum,ty_2Epair_2Eprod(ty_2Enum_2Enum,ty_2Enum_2Enum)),X22),c_2Epred__set_2EUNIV(ty_2Enum_2Enum)),ap(ap(c_2Epred__set_2ECROSS(ty_2Enum_2Enum,ty_2Enum_2Enum),c_2Epred__set_2EUNIV(ty_2Enum_2Enum)),c_2Epred__set_2EUNIV(ty_2Enum_2Enum)))) ),
inference(assume_negation,[status(cth)],[conj_thm_2Eutil__prob_2ENUM__2D__BIJ__INV]) ).
tff(c_0_7,plain,
! [X32985: del,X32986: del] : ( c_2Epred__set_2EUNIV(ty_2Epair_2Eprod(X32985,X32986)) = ap(ap(c_2Epred__set_2ECROSS(X32985,X32986),c_2Epred__set_2EUNIV(X32985)),c_2Epred__set_2EUNIV(X32986)) ),
inference(variable_rename,[status(thm)],[conj_thm_2Epred__set_2ECROSS__UNIV]) ).
tff(c_0_8,negated_conjecture,
! [X32665] :
( ~ mem(X32665,arr(ty_2Enum_2Enum,ty_2Epair_2Eprod(ty_2Enum_2Enum,ty_2Enum_2Enum)))
| ~ p(ap(ap(ap(c_2Epred__set_2EBIJ(ty_2Enum_2Enum,ty_2Epair_2Eprod(ty_2Enum_2Enum,ty_2Enum_2Enum)),X32665),c_2Epred__set_2EUNIV(ty_2Enum_2Enum)),ap(ap(c_2Epred__set_2ECROSS(ty_2Enum_2Enum,ty_2Enum_2Enum),c_2Epred__set_2EUNIV(ty_2Enum_2Enum)),c_2Epred__set_2EUNIV(ty_2Enum_2Enum)))) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])])]) ).
tff(c_0_9,plain,
! [X34972: del,X34973: del,X34974,X34975] :
( ( ~ p(ap(ap(c_2Ecardinal_2Ecardeq(X34972,X34973),X34974),X34975))
| p(ap(ap(c_2Ecardinal_2Ecardeq(X34973,X34972),X34975),X34974))
| ~ mem(X34975,arr(X34973,bool))
| ~ mem(X34974,arr(X34972,bool)) )
& ( ~ p(ap(ap(c_2Ecardinal_2Ecardeq(X34973,X34972),X34975),X34974))
| p(ap(ap(c_2Ecardinal_2Ecardeq(X34972,X34973),X34974),X34975))
| ~ mem(X34975,arr(X34973,bool))
| ~ mem(X34974,arr(X34972,bool)) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[conj_thm_2Ecardinal_2Ecardeq__SYM])])])])]) ).
tcf(c_0_10,plain,
p(ap(ap(c_2Ecardinal_2Ecardeq(ty_2Epair_2Eprod(ty_2Enum_2Enum,ty_2Enum_2Enum),ty_2Enum_2Enum),ap(ap(c_2Epred__set_2ECROSS(ty_2Enum_2Enum,ty_2Enum_2Enum),c_2Epred__set_2EUNIV(ty_2Enum_2Enum)),c_2Epred__set_2EUNIV(ty_2Enum_2Enum))),c_2Epred__set_2EUNIV(ty_2Enum_2Enum))),
inference(split_conjunct,[status(thm)],[conj_thm_2Ecardinal_2ECARD__SQUARE__NUM]) ).
tcf(c_0_11,plain,
! [X1: del,X2: del] : c_2Epred__set_2EUNIV(ty_2Epair_2Eprod(X1,X2)) = ap(ap(c_2Epred__set_2ECROSS(X1,X2),c_2Epred__set_2EUNIV(X1)),c_2Epred__set_2EUNIV(X2)),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
tff(c_0_12,plain,
! [X32872: del] : mem(c_2Epred__set_2EUNIV(X32872),arr(X32872,bool)),
inference(variable_rename,[status(thm)],[mem_c_2Epred__set_2EUNIV]) ).
tcf(c_0_13,negated_conjecture,
! [X3] :
( ~ mem(X3,arr(ty_2Enum_2Enum,ty_2Epair_2Eprod(ty_2Enum_2Enum,ty_2Enum_2Enum)))
| ~ p(ap(ap(ap(c_2Epred__set_2EBIJ(ty_2Enum_2Enum,ty_2Epair_2Eprod(ty_2Enum_2Enum,ty_2Enum_2Enum)),X3),c_2Epred__set_2EUNIV(ty_2Enum_2Enum)),ap(ap(c_2Epred__set_2ECROSS(ty_2Enum_2Enum,ty_2Enum_2Enum),c_2Epred__set_2EUNIV(ty_2Enum_2Enum)),c_2Epred__set_2EUNIV(ty_2Enum_2Enum)))) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
tff(c_0_14,plain,
! [X33257: del,X33258: del,X33259,X33260,X33262] :
( ( mem(esk95_4(X33257,X33258,X33259,X33260),arr(X33257,X33258))
| ~ p(ap(ap(c_2Ecardinal_2Ecardeq(X33257,X33258),X33259),X33260))
| ~ mem(X33260,arr(X33258,bool))
| ~ mem(X33259,arr(X33257,bool)) )
& ( p(ap(ap(ap(c_2Epred__set_2EBIJ(X33257,X33258),esk95_4(X33257,X33258,X33259,X33260)),X33259),X33260))
| ~ p(ap(ap(c_2Ecardinal_2Ecardeq(X33257,X33258),X33259),X33260))
| ~ mem(X33260,arr(X33258,bool))
| ~ mem(X33259,arr(X33257,bool)) )
& ( ~ mem(X33262,arr(X33257,X33258))
| ~ p(ap(ap(ap(c_2Epred__set_2EBIJ(X33257,X33258),X33262),X33259),X33260))
| p(ap(ap(c_2Ecardinal_2Ecardeq(X33257,X33258),X33259),X33260))
| ~ mem(X33260,arr(X33258,bool))
| ~ mem(X33259,arr(X33257,bool)) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax_thm_2Ecardinal_2Ecardeq__def])])])])])]) ).
tcf(c_0_15,plain,
! [X1: del,X3,X4,X2: del] :
( p(ap(ap(c_2Ecardinal_2Ecardeq(X2,X1),X4),X3))
| ~ p(ap(ap(c_2Ecardinal_2Ecardeq(X1,X2),X3),X4))
| ~ mem(X3,arr(X1,bool))
| ~ mem(X4,arr(X2,bool)) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
tcf(c_0_16,plain,
p(ap(ap(c_2Ecardinal_2Ecardeq(ty_2Epair_2Eprod(ty_2Enum_2Enum,ty_2Enum_2Enum),ty_2Enum_2Enum),c_2Epred__set_2EUNIV(ty_2Epair_2Eprod(ty_2Enum_2Enum,ty_2Enum_2Enum))),c_2Epred__set_2EUNIV(ty_2Enum_2Enum))),
inference(rw,[status(thm)],[c_0_10,c_0_11]) ).
tcf(c_0_17,plain,
! [X1: del] : mem(c_2Epred__set_2EUNIV(X1),arr(X1,bool)),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
tcf(c_0_18,negated_conjecture,
! [X3] :
( ~ p(ap(ap(ap(c_2Epred__set_2EBIJ(ty_2Enum_2Enum,ty_2Epair_2Eprod(ty_2Enum_2Enum,ty_2Enum_2Enum)),X3),c_2Epred__set_2EUNIV(ty_2Enum_2Enum)),c_2Epred__set_2EUNIV(ty_2Epair_2Eprod(ty_2Enum_2Enum,ty_2Enum_2Enum))))
| ~ mem(X3,arr(ty_2Enum_2Enum,ty_2Epair_2Eprod(ty_2Enum_2Enum,ty_2Enum_2Enum))) ),
inference(rw,[status(thm)],[c_0_13,c_0_11]) ).
tcf(c_0_19,plain,
! [X4,X3,X2: del,X1: del] :
( p(ap(ap(ap(c_2Epred__set_2EBIJ(X1,X2),esk95_4(X1,X2,X3,X4)),X3),X4))
| ~ p(ap(ap(c_2Ecardinal_2Ecardeq(X1,X2),X3),X4))
| ~ mem(X4,arr(X2,bool))
| ~ mem(X3,arr(X1,bool)) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
tcf(c_0_20,plain,
p(ap(ap(c_2Ecardinal_2Ecardeq(ty_2Enum_2Enum,ty_2Epair_2Eprod(ty_2Enum_2Enum,ty_2Enum_2Enum)),c_2Epred__set_2EUNIV(ty_2Enum_2Enum)),c_2Epred__set_2EUNIV(ty_2Epair_2Eprod(ty_2Enum_2Enum,ty_2Enum_2Enum)))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_17]),c_0_17])]) ).
tcf(c_0_21,negated_conjecture,
~ mem(esk95_4(ty_2Enum_2Enum,ty_2Epair_2Eprod(ty_2Enum_2Enum,ty_2Enum_2Enum),c_2Epred__set_2EUNIV(ty_2Enum_2Enum),c_2Epred__set_2EUNIV(ty_2Epair_2Eprod(ty_2Enum_2Enum,ty_2Enum_2Enum))),arr(ty_2Enum_2Enum,ty_2Epair_2Eprod(ty_2Enum_2Enum,ty_2Enum_2Enum))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_20]),c_0_17]),c_0_17])]) ).
tcf(c_0_22,plain,
! [X4,X3,X2: del,X1: del] :
( mem(esk95_4(X1,X2,X3,X4),arr(X1,X2))
| ~ p(ap(ap(c_2Ecardinal_2Ecardeq(X1,X2),X3),X4))
| ~ mem(X4,arr(X2,bool))
| ~ mem(X3,arr(X1,bool)) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_23,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_20]),c_0_17]),c_0_17])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : ITP020_5 : TPTP v8.1.2. Bugfixed v7.5.0.
% 0.08/0.14 % Command : run_E %s %d THM
% 0.14/0.36 % Computer : n031.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Fri May 3 13:19:34 EDT 2024
% 0.14/0.36 % CPUTime :
% 3.16/3.34 Running first-order model finding
% 3.16/3.34 Running: /export/starexec/sandbox2/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --satauto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/tmp/tmp.08E8Gc0ojN/E---3.1_9243.p
% 287.63/42.33 # Version: 3.1.0
% 287.63/42.33 # Preprocessing class: FMLLSMLLSSSNFFN.
% 287.63/42.33 # Scheduled 4 strats onto 8 cores with 298 seconds (2384 total)
% 287.63/42.33 # Starting new_bool_3 with 894s (3) cores
% 287.63/42.33 # Starting new_bool_1 with 894s (3) cores
% 287.63/42.33 # Starting sh5l with 298s (1) cores
% 287.63/42.33 # Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S0Y with 298s (1) cores
% 287.63/42.33 # new_bool_3 with pid 9420 completed with status 0
% 287.63/42.33 # Result found by new_bool_3
% 287.63/42.33 # Preprocessing class: FMLLSMLLSSSNFFN.
% 287.63/42.33 # Scheduled 4 strats onto 8 cores with 298 seconds (2384 total)
% 287.63/42.33 # Starting new_bool_3 with 894s (3) cores
% 287.63/42.33 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 287.63/42.33 # Search class: FGHSM-SMLM33-DFFFFFNN
% 287.63/42.33 # Scheduled 6 strats onto 3 cores with 893 seconds (893 total)
% 287.63/42.33 # Starting SAT001_MinMin_p005000_rr with 483s (1) cores
% 287.63/42.33 # Starting new_bool_3 with 90s (1) cores
% 287.63/42.33 # Starting SAT001_CA_MinMin_p005000_rr with 81s (1) cores
% 287.63/42.33 # SAT001_MinMin_p005000_rr with pid 9427 completed with status 0
% 287.63/42.33 # Result found by SAT001_MinMin_p005000_rr
% 287.63/42.33 # Preprocessing class: FMLLSMLLSSSNFFN.
% 287.63/42.33 # Scheduled 4 strats onto 8 cores with 298 seconds (2384 total)
% 287.63/42.33 # Starting new_bool_3 with 894s (3) cores
% 287.63/42.33 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 287.63/42.33 # Search class: FGHSM-SMLM33-DFFFFFNN
% 287.63/42.33 # Scheduled 6 strats onto 3 cores with 893 seconds (893 total)
% 287.63/42.33 # Starting SAT001_MinMin_p005000_rr with 483s (1) cores
% 287.63/42.33 # Preprocessing time : 0.207 s
% 287.63/42.33 # Presaturation interreduction done
% 287.63/42.33
% 287.63/42.33 # Proof found!
% 287.63/42.33 # SZS status Theorem
% 287.63/42.33 # SZS output start CNFRefutation
% See solution above
% 287.63/42.33 # Parsed axioms : 25383
% 287.63/42.33 # Removed by relevancy pruning/SinE : 23163
% 287.63/42.33 # Initial clauses : 7851
% 287.63/42.33 # Removed in clause preprocessing : 1567
% 287.63/42.33 # Initial clauses in saturation : 6284
% 287.63/42.33 # Processed clauses : 28998
% 287.63/42.33 # ...of these trivial : 421
% 287.63/42.33 # ...subsumed : 12866
% 287.63/42.33 # ...remaining for further processing : 15711
% 287.63/42.33 # Other redundant clauses eliminated : 2030
% 287.63/42.33 # Clauses deleted for lack of memory : 0
% 287.63/42.33 # Backward-subsumed : 406
% 287.63/42.33 # Backward-rewritten : 195
% 287.63/42.33 # Generated clauses : 767225
% 287.63/42.33 # ...of the previous two non-redundant : 752454
% 287.63/42.33 # ...aggressively subsumed : 0
% 287.63/42.33 # Contextual simplify-reflections : 114
% 287.63/42.33 # Paramodulations : 765164
% 287.63/42.33 # Factorizations : 28
% 287.63/42.33 # NegExts : 0
% 287.63/42.33 # Equation resolutions : 2093
% 287.63/42.33 # Disequality decompositions : 0
% 287.63/42.33 # Total rewrite steps : 76046
% 287.63/42.33 # ...of those cached : 74349
% 287.63/42.33 # Propositional unsat checks : 4
% 287.63/42.33 # Propositional check models : 2
% 287.63/42.33 # Propositional check unsatisfiable : 0
% 287.63/42.33 # Propositional clauses : 0
% 287.63/42.33 # Propositional clauses after purity: 0
% 287.63/42.33 # Propositional unsat core size : 0
% 287.63/42.33 # Propositional preprocessing time : 0.000
% 287.63/42.33 # Propositional encoding time : 3.220
% 287.63/42.33 # Propositional solver time : 1.102
% 287.63/42.33 # Success case prop preproc time : 0.000
% 287.63/42.33 # Success case prop encoding time : 0.000
% 287.63/42.33 # Success case prop solver time : 0.000
% 287.63/42.33 # Current number of processed clauses : 9259
% 287.63/42.33 # Positive orientable unit clauses : 797
% 287.63/42.33 # Positive unorientable unit clauses: 17
% 287.63/42.33 # Negative unit clauses : 1347
% 287.63/42.33 # Non-unit-clauses : 7098
% 287.63/42.33 # Current number of unprocessed clauses: 729497
% 287.63/42.33 # ...number of literals in the above : 3325789
% 287.63/42.33 # Current number of archived formulas : 0
% 287.63/42.33 # Current number of archived clauses : 6087
% 287.63/42.33 # Clause-clause subsumption calls (NU) : 13259925
% 287.63/42.33 # Rec. Clause-clause subsumption calls : 1620144
% 287.63/42.33 # Non-unit clause-clause subsumptions : 10593
% 287.63/42.33 # Unit Clause-clause subsumption calls : 328648
% 287.63/42.33 # Rewrite failures with RHS unbound : 0
% 287.63/42.33 # BW rewrite match attempts : 39068
% 287.63/42.33 # BW rewrite match successes : 315
% 287.63/42.33 # Condensation attempts : 0
% 287.63/42.33 # Condensation successes : 0
% 287.63/42.33 # Termbank termtop insertions : 31581644
% 287.63/42.33 # Search garbage collected termcells : 498484
% 287.63/42.33
% 287.63/42.33 # -------------------------------------------------
% 287.63/42.33 # User time : 34.976 s
% 287.63/42.33 # System time : 0.839 s
% 287.63/42.33 # Total time : 35.815 s
% 287.63/42.33 # Maximum resident set size: 92904 pages
% 287.63/42.33
% 287.63/42.33 # -------------------------------------------------
% 287.63/42.33 # User time : 105.871 s
% 287.63/42.33 # System time : 1.727 s
% 287.63/42.33 # Total time : 107.598 s
% 287.63/42.33 # Maximum resident set size: 72416 pages
% 287.63/42.33 % E---3.1 exiting
%------------------------------------------------------------------------------