TSTP Solution File: SEU255+2 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : SEU255+2 : TPTP v8.1.2. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n011.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 : 2400s
% WCLimit : 300s
% DateTime : Tue Oct 10 19:31:10 EDT 2023
% Result : Theorem 1.22s 0.62s
% Output : CNFRefutation 1.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 13
% Syntax : Number of formulae : 64 ( 31 unt; 0 def)
% Number of atoms : 137 ( 31 equ)
% Maximal formula atoms : 14 ( 2 avg)
% Number of connectives : 121 ( 48 ~; 49 |; 10 &)
% ( 2 <=>; 12 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 3 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 2 con; 0-2 aty)
% Number of variables : 97 ( 8 sgn; 56 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t25_wellord1,conjecture,
! [X1,X2] :
( relation(X2)
=> ( antisymmetric(X2)
=> antisymmetric(relation_restriction(X2,X1)) ) ),
file('/export/starexec/sandbox/tmp/tmp.dfY2fuZEc7/E---3.1_2384.p',t25_wellord1) ).
fof(d6_wellord1,axiom,
! [X1] :
( relation(X1)
=> ! [X2] : relation_restriction(X1,X2) = set_intersection2(X1,cartesian_product2(X2,X2)) ),
file('/export/starexec/sandbox/tmp/tmp.dfY2fuZEc7/E---3.1_2384.p',d6_wellord1) ).
fof(t17_xboole_1,lemma,
! [X1,X2] : subset(set_intersection2(X1,X2),X1),
file('/export/starexec/sandbox/tmp/tmp.dfY2fuZEc7/E---3.1_2384.p',t17_xboole_1) ).
fof(fc3_relat_1,axiom,
! [X1,X2] :
( ( relation(X1)
& relation(X2) )
=> relation(set_difference(X1,X2)) ),
file('/export/starexec/sandbox/tmp/tmp.dfY2fuZEc7/E---3.1_2384.p',fc3_relat_1) ).
fof(t40_xboole_1,lemma,
! [X1,X2] : set_difference(set_union2(X1,X2),X2) = set_difference(X1,X2),
file('/export/starexec/sandbox/tmp/tmp.dfY2fuZEc7/E---3.1_2384.p',t40_xboole_1) ).
fof(t12_xboole_1,lemma,
! [X1,X2] :
( subset(X1,X2)
=> set_union2(X1,X2) = X2 ),
file('/export/starexec/sandbox/tmp/tmp.dfY2fuZEc7/E---3.1_2384.p',t12_xboole_1) ).
fof(commutativity_k2_xboole_0,axiom,
! [X1,X2] : set_union2(X1,X2) = set_union2(X2,X1),
file('/export/starexec/sandbox/tmp/tmp.dfY2fuZEc7/E---3.1_2384.p',commutativity_k2_xboole_0) ).
fof(t48_xboole_1,lemma,
! [X1,X2] : set_difference(X1,set_difference(X1,X2)) = set_intersection2(X1,X2),
file('/export/starexec/sandbox/tmp/tmp.dfY2fuZEc7/E---3.1_2384.p',t48_xboole_1) ).
fof(dt_k2_wellord1,axiom,
! [X1,X2] :
( relation(X1)
=> relation(relation_restriction(X1,X2)) ),
file('/export/starexec/sandbox/tmp/tmp.dfY2fuZEc7/E---3.1_2384.p',dt_k2_wellord1) ).
fof(t28_xboole_1,lemma,
! [X1,X2] :
( subset(X1,X2)
=> set_intersection2(X1,X2) = X1 ),
file('/export/starexec/sandbox/tmp/tmp.dfY2fuZEc7/E---3.1_2384.p',t28_xboole_1) ).
fof(commutativity_k3_xboole_0,axiom,
! [X1,X2] : set_intersection2(X1,X2) = set_intersection2(X2,X1),
file('/export/starexec/sandbox/tmp/tmp.dfY2fuZEc7/E---3.1_2384.p',commutativity_k3_xboole_0) ).
fof(l3_wellord1,lemma,
! [X1] :
( relation(X1)
=> ( antisymmetric(X1)
<=> ! [X2,X3] :
( ( in(ordered_pair(X2,X3),X1)
& in(ordered_pair(X3,X2),X1) )
=> X2 = X3 ) ) ),
file('/export/starexec/sandbox/tmp/tmp.dfY2fuZEc7/E---3.1_2384.p',l3_wellord1) ).
fof(t16_wellord1,lemma,
! [X1,X2,X3] :
( relation(X3)
=> ( in(X1,relation_restriction(X3,X2))
<=> ( in(X1,X3)
& in(X1,cartesian_product2(X2,X2)) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.dfY2fuZEc7/E---3.1_2384.p',t16_wellord1) ).
fof(c_0_13,negated_conjecture,
~ ! [X1,X2] :
( relation(X2)
=> ( antisymmetric(X2)
=> antisymmetric(relation_restriction(X2,X1)) ) ),
inference(assume_negation,[status(cth)],[t25_wellord1]) ).
fof(c_0_14,plain,
! [X15,X16] :
( ~ relation(X15)
| relation_restriction(X15,X16) = set_intersection2(X15,cartesian_product2(X16,X16)) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[d6_wellord1])])]) ).
fof(c_0_15,negated_conjecture,
( relation(esk2_0)
& antisymmetric(esk2_0)
& ~ antisymmetric(relation_restriction(esk2_0,esk1_0)) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_13])])]) ).
fof(c_0_16,lemma,
! [X126,X127] : subset(set_intersection2(X126,X127),X126),
inference(variable_rename,[status(thm)],[t17_xboole_1]) ).
cnf(c_0_17,plain,
( relation_restriction(X1,X2) = set_intersection2(X1,cartesian_product2(X2,X2))
| ~ relation(X1) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_18,negated_conjecture,
relation(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
fof(c_0_19,plain,
! [X365,X366] :
( ~ relation(X365)
| ~ relation(X366)
| relation(set_difference(X365,X366)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fc3_relat_1])]) ).
fof(c_0_20,lemma,
! [X307,X308] : set_difference(set_union2(X307,X308),X308) = set_difference(X307,X308),
inference(variable_rename,[status(thm)],[t40_xboole_1]) ).
fof(c_0_21,lemma,
! [X302,X303] :
( ~ subset(X302,X303)
| set_union2(X302,X303) = X303 ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t12_xboole_1])]) ).
cnf(c_0_22,lemma,
subset(set_intersection2(X1,X2),X1),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_23,negated_conjecture,
set_intersection2(esk2_0,cartesian_product2(X1,X1)) = relation_restriction(esk2_0,X1),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
fof(c_0_24,plain,
! [X282,X283] : set_union2(X282,X283) = set_union2(X283,X282),
inference(variable_rename,[status(thm)],[commutativity_k2_xboole_0]) ).
cnf(c_0_25,plain,
( relation(set_difference(X1,X2))
| ~ relation(X1)
| ~ relation(X2) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_26,lemma,
set_difference(set_union2(X1,X2),X2) = set_difference(X1,X2),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_27,lemma,
( set_union2(X1,X2) = X2
| ~ subset(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_28,lemma,
subset(relation_restriction(esk2_0,X1),esk2_0),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_29,plain,
set_union2(X1,X2) = set_union2(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
fof(c_0_30,lemma,
! [X137,X138] : set_difference(X137,set_difference(X137,X138)) = set_intersection2(X137,X138),
inference(variable_rename,[status(thm)],[t48_xboole_1]) ).
cnf(c_0_31,lemma,
( relation(set_difference(X1,X2))
| ~ relation(set_union2(X1,X2))
| ~ relation(X2) ),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_32,lemma,
set_union2(esk2_0,relation_restriction(esk2_0,X1)) = esk2_0,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_29]) ).
fof(c_0_33,plain,
! [X17,X18] :
( ~ relation(X17)
| relation(relation_restriction(X17,X18)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[dt_k2_wellord1])]) ).
cnf(c_0_34,lemma,
set_difference(X1,set_difference(X1,X2)) = set_intersection2(X1,X2),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
cnf(c_0_35,lemma,
( relation(set_difference(esk2_0,relation_restriction(esk2_0,X1)))
| ~ relation(relation_restriction(esk2_0,X1)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_18])]) ).
cnf(c_0_36,plain,
( relation(relation_restriction(X1,X2))
| ~ relation(X1) ),
inference(split_conjunct,[status(thm)],[c_0_33]) ).
fof(c_0_37,lemma,
! [X134,X135] :
( ~ subset(X134,X135)
| set_intersection2(X134,X135) = X134 ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t28_xboole_1])]) ).
fof(c_0_38,plain,
! [X110,X111] : set_intersection2(X110,X111) = set_intersection2(X111,X110),
inference(variable_rename,[status(thm)],[commutativity_k3_xboole_0]) ).
fof(c_0_39,lemma,
! [X10,X11,X12] :
( ( ~ antisymmetric(X10)
| ~ in(ordered_pair(X11,X12),X10)
| ~ in(ordered_pair(X12,X11),X10)
| X11 = X12
| ~ relation(X10) )
& ( in(ordered_pair(esk3_1(X10),esk4_1(X10)),X10)
| antisymmetric(X10)
| ~ relation(X10) )
& ( in(ordered_pair(esk4_1(X10),esk3_1(X10)),X10)
| antisymmetric(X10)
| ~ relation(X10) )
& ( esk3_1(X10) != esk4_1(X10)
| antisymmetric(X10)
| ~ relation(X10) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[l3_wellord1])])])])]) ).
cnf(c_0_40,lemma,
( relation(set_intersection2(X1,X2))
| ~ relation(set_difference(X1,X2))
| ~ relation(X1) ),
inference(spm,[status(thm)],[c_0_25,c_0_34]) ).
cnf(c_0_41,lemma,
relation(set_difference(esk2_0,relation_restriction(esk2_0,X1))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),c_0_18])]) ).
cnf(c_0_42,lemma,
( set_intersection2(X1,X2) = X1
| ~ subset(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_37]) ).
cnf(c_0_43,plain,
set_intersection2(X1,X2) = set_intersection2(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_38]) ).
cnf(c_0_44,negated_conjecture,
~ antisymmetric(relation_restriction(esk2_0,esk1_0)),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_45,lemma,
( in(ordered_pair(esk4_1(X1),esk3_1(X1)),X1)
| antisymmetric(X1)
| ~ relation(X1) ),
inference(split_conjunct,[status(thm)],[c_0_39]) ).
cnf(c_0_46,lemma,
relation(set_intersection2(esk2_0,relation_restriction(esk2_0,X1))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_41]),c_0_18])]) ).
cnf(c_0_47,lemma,
set_intersection2(esk2_0,relation_restriction(esk2_0,X1)) = relation_restriction(esk2_0,X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_28]),c_0_43]) ).
fof(c_0_48,lemma,
! [X19,X20,X21] :
( ( in(X19,X21)
| ~ in(X19,relation_restriction(X21,X20))
| ~ relation(X21) )
& ( in(X19,cartesian_product2(X20,X20))
| ~ in(X19,relation_restriction(X21,X20))
| ~ relation(X21) )
& ( ~ in(X19,X21)
| ~ in(X19,cartesian_product2(X20,X20))
| in(X19,relation_restriction(X21,X20))
| ~ relation(X21) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t16_wellord1])])]) ).
cnf(c_0_49,negated_conjecture,
( in(ordered_pair(esk4_1(relation_restriction(esk2_0,esk1_0)),esk3_1(relation_restriction(esk2_0,esk1_0))),relation_restriction(esk2_0,esk1_0))
| ~ relation(relation_restriction(esk2_0,esk1_0)) ),
inference(spm,[status(thm)],[c_0_44,c_0_45]) ).
cnf(c_0_50,lemma,
relation(relation_restriction(esk2_0,X1)),
inference(rw,[status(thm)],[c_0_46,c_0_47]) ).
cnf(c_0_51,lemma,
( in(ordered_pair(esk3_1(X1),esk4_1(X1)),X1)
| antisymmetric(X1)
| ~ relation(X1) ),
inference(split_conjunct,[status(thm)],[c_0_39]) ).
cnf(c_0_52,lemma,
( in(X1,X2)
| ~ in(X1,relation_restriction(X2,X3))
| ~ relation(X2) ),
inference(split_conjunct,[status(thm)],[c_0_48]) ).
cnf(c_0_53,negated_conjecture,
in(ordered_pair(esk4_1(relation_restriction(esk2_0,esk1_0)),esk3_1(relation_restriction(esk2_0,esk1_0))),relation_restriction(esk2_0,esk1_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_49,c_0_50])]) ).
cnf(c_0_54,negated_conjecture,
( in(ordered_pair(esk3_1(relation_restriction(esk2_0,esk1_0)),esk4_1(relation_restriction(esk2_0,esk1_0))),relation_restriction(esk2_0,esk1_0))
| ~ relation(relation_restriction(esk2_0,esk1_0)) ),
inference(spm,[status(thm)],[c_0_44,c_0_51]) ).
cnf(c_0_55,lemma,
( X2 = X3
| ~ antisymmetric(X1)
| ~ in(ordered_pair(X2,X3),X1)
| ~ in(ordered_pair(X3,X2),X1)
| ~ relation(X1) ),
inference(split_conjunct,[status(thm)],[c_0_39]) ).
cnf(c_0_56,lemma,
in(ordered_pair(esk4_1(relation_restriction(esk2_0,esk1_0)),esk3_1(relation_restriction(esk2_0,esk1_0))),esk2_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_53]),c_0_18])]) ).
cnf(c_0_57,negated_conjecture,
antisymmetric(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_58,negated_conjecture,
in(ordered_pair(esk3_1(relation_restriction(esk2_0,esk1_0)),esk4_1(relation_restriction(esk2_0,esk1_0))),relation_restriction(esk2_0,esk1_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_54,c_0_50])]) ).
cnf(c_0_59,lemma,
( esk4_1(relation_restriction(esk2_0,esk1_0)) = esk3_1(relation_restriction(esk2_0,esk1_0))
| ~ in(ordered_pair(esk3_1(relation_restriction(esk2_0,esk1_0)),esk4_1(relation_restriction(esk2_0,esk1_0))),esk2_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_55,c_0_56]),c_0_57]),c_0_18])]) ).
cnf(c_0_60,lemma,
in(ordered_pair(esk3_1(relation_restriction(esk2_0,esk1_0)),esk4_1(relation_restriction(esk2_0,esk1_0))),esk2_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_58]),c_0_18])]) ).
cnf(c_0_61,lemma,
( antisymmetric(X1)
| esk3_1(X1) != esk4_1(X1)
| ~ relation(X1) ),
inference(split_conjunct,[status(thm)],[c_0_39]) ).
cnf(c_0_62,lemma,
esk4_1(relation_restriction(esk2_0,esk1_0)) = esk3_1(relation_restriction(esk2_0,esk1_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_59,c_0_60])]) ).
cnf(c_0_63,lemma,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_61,c_0_62]),c_0_50])]),c_0_44]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.10 % Problem : SEU255+2 : TPTP v8.1.2. Released v3.3.0.
% 0.10/0.11 % Command : run_E %s %d THM
% 0.11/0.31 % Computer : n011.cluster.edu
% 0.11/0.31 % Model : x86_64 x86_64
% 0.11/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.31 % Memory : 8042.1875MB
% 0.11/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 2400
% 0.11/0.32 % WCLimit : 300
% 0.11/0.32 % DateTime : Mon Oct 2 08:48:53 EDT 2023
% 0.11/0.32 % CPUTime :
% 0.17/0.45 Running first-order model finding
% 0.17/0.45 Running: /export/starexec/sandbox/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/sandbox/tmp/tmp.dfY2fuZEc7/E---3.1_2384.p
% 1.22/0.62 # Version: 3.1pre001
% 1.22/0.62 # Preprocessing class: FSLSSMSSSSSNFFN.
% 1.22/0.62 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.22/0.62 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 1.22/0.62 # Starting new_bool_3 with 300s (1) cores
% 1.22/0.62 # Starting new_bool_1 with 300s (1) cores
% 1.22/0.62 # Starting sh5l with 300s (1) cores
% 1.22/0.62 # new_bool_3 with pid 2462 completed with status 0
% 1.22/0.62 # Result found by new_bool_3
% 1.22/0.62 # Preprocessing class: FSLSSMSSSSSNFFN.
% 1.22/0.62 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.22/0.62 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 1.22/0.62 # Starting new_bool_3 with 300s (1) cores
% 1.22/0.62 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 1.22/0.62 # Search class: FGHSM-FSLM32-SFFFFFNN
% 1.22/0.62 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 1.22/0.62 # Starting G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI with 127s (1) cores
% 1.22/0.62 # G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI with pid 2465 completed with status 0
% 1.22/0.62 # Result found by G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI
% 1.22/0.62 # Preprocessing class: FSLSSMSSSSSNFFN.
% 1.22/0.62 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.22/0.62 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 1.22/0.62 # Starting new_bool_3 with 300s (1) cores
% 1.22/0.62 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 1.22/0.62 # Search class: FGHSM-FSLM32-SFFFFFNN
% 1.22/0.62 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 1.22/0.62 # Starting G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI with 127s (1) cores
% 1.22/0.62 # Preprocessing time : 0.004 s
% 1.22/0.62
% 1.22/0.62 # Proof found!
% 1.22/0.62 # SZS status Theorem
% 1.22/0.62 # SZS output start CNFRefutation
% See solution above
% 1.22/0.62 # Parsed axioms : 314
% 1.22/0.62 # Removed by relevancy pruning/SinE : 174
% 1.22/0.62 # Initial clauses : 289
% 1.22/0.62 # Removed in clause preprocessing : 2
% 1.22/0.62 # Initial clauses in saturation : 287
% 1.22/0.62 # Processed clauses : 1341
% 1.22/0.62 # ...of these trivial : 38
% 1.22/0.62 # ...subsumed : 417
% 1.22/0.62 # ...remaining for further processing : 886
% 1.22/0.62 # Other redundant clauses eliminated : 38
% 1.22/0.62 # Clauses deleted for lack of memory : 0
% 1.22/0.62 # Backward-subsumed : 37
% 1.22/0.62 # Backward-rewritten : 71
% 1.22/0.62 # Generated clauses : 7332
% 1.22/0.62 # ...of the previous two non-redundant : 6810
% 1.22/0.62 # ...aggressively subsumed : 0
% 1.22/0.62 # Contextual simplify-reflections : 3
% 1.22/0.62 # Paramodulations : 7280
% 1.22/0.62 # Factorizations : 14
% 1.22/0.62 # NegExts : 0
% 1.22/0.62 # Equation resolutions : 40
% 1.22/0.62 # Total rewrite steps : 1749
% 1.22/0.62 # Propositional unsat checks : 0
% 1.22/0.62 # Propositional check models : 0
% 1.22/0.62 # Propositional check unsatisfiable : 0
% 1.22/0.62 # Propositional clauses : 0
% 1.22/0.62 # Propositional clauses after purity: 0
% 1.22/0.62 # Propositional unsat core size : 0
% 1.22/0.62 # Propositional preprocessing time : 0.000
% 1.22/0.62 # Propositional encoding time : 0.000
% 1.22/0.62 # Propositional solver time : 0.000
% 1.22/0.62 # Success case prop preproc time : 0.000
% 1.22/0.62 # Success case prop encoding time : 0.000
% 1.22/0.62 # Success case prop solver time : 0.000
% 1.22/0.62 # Current number of processed clauses : 743
% 1.22/0.62 # Positive orientable unit clauses : 160
% 1.22/0.62 # Positive unorientable unit clauses: 2
% 1.22/0.62 # Negative unit clauses : 29
% 1.22/0.62 # Non-unit-clauses : 552
% 1.22/0.62 # Current number of unprocessed clauses: 5673
% 1.22/0.62 # ...number of literals in the above : 14916
% 1.22/0.62 # Current number of archived formulas : 0
% 1.22/0.62 # Current number of archived clauses : 108
% 1.22/0.62 # Clause-clause subsumption calls (NU) : 41476
% 1.22/0.62 # Rec. Clause-clause subsumption calls : 26045
% 1.22/0.62 # Non-unit clause-clause subsumptions : 349
% 1.22/0.62 # Unit Clause-clause subsumption calls : 12177
% 1.22/0.62 # Rewrite failures with RHS unbound : 0
% 1.22/0.62 # BW rewrite match attempts : 149
% 1.22/0.62 # BW rewrite match successes : 36
% 1.22/0.62 # Condensation attempts : 0
% 1.22/0.62 # Condensation successes : 0
% 1.22/0.62 # Termbank termtop insertions : 139048
% 1.22/0.62
% 1.22/0.62 # -------------------------------------------------
% 1.22/0.62 # User time : 0.139 s
% 1.22/0.62 # System time : 0.013 s
% 1.22/0.62 # Total time : 0.152 s
% 1.22/0.62 # Maximum resident set size: 2856 pages
% 1.22/0.62
% 1.22/0.62 # -------------------------------------------------
% 1.22/0.62 # User time : 0.147 s
% 1.22/0.62 # System time : 0.015 s
% 1.22/0.62 # Total time : 0.161 s
% 1.22/0.62 # Maximum resident set size: 2020 pages
% 1.22/0.62 % E---3.1 exiting
%------------------------------------------------------------------------------