TSTP Solution File: CSR083+4 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : CSR083+4 : TPTP v8.2.0. Bugfixed v7.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n012.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 : Mon May 20 19:18:15 EDT 2024
% Result : Theorem 19.23s 3.29s
% Output : CNFRefutation 19.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 20
% Number of leaves : 10
% Syntax : Number of formulae : 54 ( 17 unt; 0 def)
% Number of atoms : 183 ( 32 equ)
% Maximal formula atoms : 45 ( 3 avg)
% Number of connectives : 208 ( 79 ~; 85 |; 32 &)
% ( 3 <=>; 9 =>; 0 <=; 0 <~>)
% Maximal formula depth : 24 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 14 ( 14 usr; 8 con; 0-3 aty)
% Number of variables : 94 ( 27 sgn 38 !; 3 ?)
% Comments :
%------------------------------------------------------------------------------
fof(prove_from_SUMO,conjecture,
? [X591] :
( s__subclass(X591,s__Animal)
& s__subclass(X591,s__CognitiveAgent)
& X591 = s__Human ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_from_SUMO) ).
fof(kb_SUMO_5999,axiom,
s__subclass(s__Invertebrate,s__Animal),
file('/export/starexec/sandbox/benchmark/Axioms/CSR003+0.ax',kb_SUMO_5999) ).
fof(kb_SUMO_3496,axiom,
! [X171,X172,X173] :
( X172 = s__UnionFn(X173,X171)
<=> ! [X174,X175,X176] :
( ( s__instance(X173,s__SetOrClass)
& s__instance(X172,s__SetOrClass)
& s__instance(X171,s__SetOrClass) )
=> ( ( s__instance(X174,X173)
& s__instance(X175,X171)
& s__instance(X176,X172) )
=> ( s__instance(X174,X172)
& s__instance(X175,X172)
& ( s__instance(X176,X173)
| s__instance(X176,X171) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/CSR003+0.ax',kb_SUMO_3496) ).
fof(kb_SUMO_3533,axiom,
! [X168] :
( s__instance(X168,s__SetOrClass)
=> ( s__instance(X168,s__NullSet)
=> ~ ? [X48] : s__instance(X48,X168) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/CSR003+0.ax',kb_SUMO_3533) ).
fof(kb_SUMO_6087,axiom,
s__subclass(s__Human,s__CognitiveAgent),
file('/export/starexec/sandbox/benchmark/Axioms/CSR003+0.ax',kb_SUMO_6087) ).
fof(kb_SUMO_276,axiom,
! [X9,X10] :
( s__disjoint(X9,X10)
<=> ! [X48] :
( ( s__instance(X10,s__SetOrClass)
& s__instance(X9,s__SetOrClass) )
=> ~ ( s__instance(X48,X9)
& s__instance(X48,X10) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/CSR003+0.ax',kb_SUMO_276) ).
fof(kb_SUMO_26,axiom,
! [X6,X7] :
( s__subclass(X6,X7)
=> ( s__instance(X6,s__SetOrClass)
& s__instance(X7,s__SetOrClass) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/CSR003+0.ax',kb_SUMO_26) ).
fof(kb_SUMO_987,axiom,
! [X48] :
( s__instance(X48,s__SetOrClass)
=> s__subclass(X48,X48) ),
file('/export/starexec/sandbox/benchmark/Axioms/CSR003+0.ax',kb_SUMO_987) ).
fof(kb_SUMO_3489,axiom,
! [X169,X170] :
( ! [X49] :
( ( s__instance(X170,s__Set)
& s__instance(X169,s__Set) )
=> ( s__element(X49,X170)
<=> s__element(X49,X169) ) )
=> X170 = X169 ),
file('/export/starexec/sandbox/benchmark/Axioms/CSR003+0.ax',kb_SUMO_3489) ).
fof(kb_SUMO_5980,axiom,
s__subclass(s__Animal,s__Organism),
file('/export/starexec/sandbox/benchmark/Axioms/CSR003+0.ax',kb_SUMO_5980) ).
fof(c_0_10,negated_conjecture,
~ ? [X591] :
( s__subclass(X591,s__Animal)
& s__subclass(X591,s__CognitiveAgent)
& X591 = s__Human ),
inference(assume_negation,[status(cth)],[prove_from_SUMO]) ).
fof(c_0_11,negated_conjecture,
! [X8161] :
( ~ s__subclass(X8161,s__Animal)
| ~ s__subclass(X8161,s__CognitiveAgent)
| X8161 != s__Human ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_10])])]) ).
cnf(c_0_12,negated_conjecture,
( ~ s__subclass(X1,s__Animal)
| ~ s__subclass(X1,s__CognitiveAgent)
| X1 != s__Human ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_13,plain,
s__subclass(s__Invertebrate,s__Animal),
inference(split_conjunct,[status(thm)],[kb_SUMO_5999]) ).
fof(c_0_14,plain,
! [X6423,X6424,X6425,X6426,X6427,X6428,X6429,X6430,X6431] :
( ( s__instance(X6426,X6424)
| ~ s__instance(X6426,X6425)
| ~ s__instance(X6427,X6423)
| ~ s__instance(X6428,X6424)
| ~ s__instance(X6425,s__SetOrClass)
| ~ s__instance(X6424,s__SetOrClass)
| ~ s__instance(X6423,s__SetOrClass)
| X6424 != s__UnionFn(X6425,X6423) )
& ( s__instance(X6427,X6424)
| ~ s__instance(X6426,X6425)
| ~ s__instance(X6427,X6423)
| ~ s__instance(X6428,X6424)
| ~ s__instance(X6425,s__SetOrClass)
| ~ s__instance(X6424,s__SetOrClass)
| ~ s__instance(X6423,s__SetOrClass)
| X6424 != s__UnionFn(X6425,X6423) )
& ( s__instance(X6428,X6425)
| s__instance(X6428,X6423)
| ~ s__instance(X6426,X6425)
| ~ s__instance(X6427,X6423)
| ~ s__instance(X6428,X6424)
| ~ s__instance(X6425,s__SetOrClass)
| ~ s__instance(X6424,s__SetOrClass)
| ~ s__instance(X6423,s__SetOrClass)
| X6424 != s__UnionFn(X6425,X6423) )
& ( s__instance(X6431,s__SetOrClass)
| X6430 = s__UnionFn(X6431,X6429) )
& ( s__instance(X6430,s__SetOrClass)
| X6430 = s__UnionFn(X6431,X6429) )
& ( s__instance(X6429,s__SetOrClass)
| X6430 = s__UnionFn(X6431,X6429) )
& ( s__instance(esk158_3(X6429,X6430,X6431),X6431)
| X6430 = s__UnionFn(X6431,X6429) )
& ( s__instance(esk159_3(X6429,X6430,X6431),X6429)
| X6430 = s__UnionFn(X6431,X6429) )
& ( s__instance(esk160_3(X6429,X6430,X6431),X6430)
| X6430 = s__UnionFn(X6431,X6429) )
& ( ~ s__instance(esk160_3(X6429,X6430,X6431),X6431)
| ~ s__instance(esk158_3(X6429,X6430,X6431),X6430)
| ~ s__instance(esk159_3(X6429,X6430,X6431),X6430)
| X6430 = s__UnionFn(X6431,X6429) )
& ( ~ s__instance(esk160_3(X6429,X6430,X6431),X6429)
| ~ s__instance(esk158_3(X6429,X6430,X6431),X6430)
| ~ s__instance(esk159_3(X6429,X6430,X6431),X6430)
| X6430 = s__UnionFn(X6431,X6429) ) ),
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)],[kb_SUMO_3496])])])])])])]) ).
cnf(c_0_15,negated_conjecture,
( s__Invertebrate != s__Human
| ~ s__subclass(s__Invertebrate,s__CognitiveAgent) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_16,plain,
( s__instance(X1,s__SetOrClass)
| X2 = s__UnionFn(X3,X1) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_17,negated_conjecture,
( s__instance(X1,s__SetOrClass)
| ~ s__subclass(s__UnionFn(X2,X1),s__CognitiveAgent) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_16]) ).
fof(c_0_18,plain,
! [X6435,X6436] :
( ~ s__instance(X6435,s__SetOrClass)
| ~ s__instance(X6435,s__NullSet)
| ~ s__instance(X6436,X6435) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[kb_SUMO_3533])])])]) ).
cnf(c_0_19,negated_conjecture,
( s__instance(X1,s__SetOrClass)
| ~ s__subclass(X2,s__CognitiveAgent) ),
inference(spm,[status(thm)],[c_0_17,c_0_16]) ).
cnf(c_0_20,plain,
s__subclass(s__Human,s__CognitiveAgent),
inference(split_conjunct,[status(thm)],[kb_SUMO_6087]) ).
cnf(c_0_21,plain,
( ~ s__instance(X1,s__SetOrClass)
| ~ s__instance(X1,s__NullSet)
| ~ s__instance(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_22,negated_conjecture,
s__instance(X1,s__SetOrClass),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
fof(c_0_23,plain,
! [X1513,X1514,X1515,X1516,X1517] :
( ( ~ s__disjoint(X1513,X1514)
| ~ s__instance(X1514,s__SetOrClass)
| ~ s__instance(X1513,s__SetOrClass)
| ~ s__instance(X1515,X1513)
| ~ s__instance(X1515,X1514) )
& ( s__instance(X1517,s__SetOrClass)
| s__disjoint(X1516,X1517) )
& ( s__instance(X1516,s__SetOrClass)
| s__disjoint(X1516,X1517) )
& ( s__instance(esk1_2(X1516,X1517),X1516)
| s__disjoint(X1516,X1517) )
& ( s__instance(esk1_2(X1516,X1517),X1517)
| s__disjoint(X1516,X1517) ) ),
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)],[kb_SUMO_276])])])])])])]) ).
fof(c_0_24,plain,
! [X603,X604] :
( ( s__instance(X603,s__SetOrClass)
| ~ s__subclass(X603,X604) )
& ( s__instance(X604,s__SetOrClass)
| ~ s__subclass(X603,X604) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[kb_SUMO_26])])])]) ).
cnf(c_0_25,plain,
( ~ s__instance(X1,s__NullSet)
| ~ s__instance(X2,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_21,c_0_22])]) ).
cnf(c_0_26,plain,
( s__instance(esk1_2(X1,X2),X1)
| s__disjoint(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
fof(c_0_27,plain,
! [X2565] :
( ~ s__instance(X2565,s__SetOrClass)
| s__subclass(X2565,X2565) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[kb_SUMO_987])])]) ).
cnf(c_0_28,plain,
( s__instance(X1,s__SetOrClass)
| ~ s__subclass(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_29,plain,
( s__disjoint(s__NullSet,X1)
| ~ s__instance(X2,esk1_2(s__NullSet,X1)) ),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_30,plain,
( s__instance(esk158_3(X1,X2,X3),X3)
| X2 = s__UnionFn(X3,X1) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_31,plain,
( s__subclass(X1,X1)
| ~ s__instance(X1,s__SetOrClass) ),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_32,plain,
s__instance(s__Animal,s__SetOrClass),
inference(spm,[status(thm)],[c_0_28,c_0_13]) ).
cnf(c_0_33,plain,
( X1 = s__UnionFn(esk1_2(s__NullSet,X2),X3)
| s__disjoint(s__NullSet,X2) ),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_34,negated_conjecture,
( s__Animal != s__Human
| ~ s__subclass(s__Animal,s__CognitiveAgent) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_31]),c_0_32])]) ).
cnf(c_0_35,plain,
( X1 = X2
| s__disjoint(s__NullSet,X3) ),
inference(spm,[status(thm)],[c_0_33,c_0_33]) ).
fof(c_0_36,plain,
! [X6420,X6421] :
( ( s__instance(X6421,s__Set)
| X6421 = X6420 )
& ( s__instance(X6420,s__Set)
| X6421 = X6420 )
& ( ~ s__element(esk157_2(X6420,X6421),X6421)
| ~ s__element(esk157_2(X6420,X6421),X6420)
| X6421 = X6420 )
& ( s__element(esk157_2(X6420,X6421),X6421)
| s__element(esk157_2(X6420,X6421),X6420)
| X6421 = X6420 ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[kb_SUMO_3489])])])])])]) ).
cnf(c_0_37,plain,
( ~ s__disjoint(X1,X2)
| ~ s__instance(X2,s__SetOrClass)
| ~ s__instance(X1,s__SetOrClass)
| ~ s__instance(X3,X1)
| ~ s__instance(X3,X2) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_38,negated_conjecture,
( s__disjoint(s__NullSet,X1)
| ~ s__subclass(s__Animal,X2) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_35]) ).
cnf(c_0_39,plain,
s__subclass(X1,X1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_31,c_0_22])]) ).
cnf(c_0_40,plain,
( s__instance(X1,s__Set)
| X2 = X1 ),
inference(split_conjunct,[status(thm)],[c_0_36]) ).
cnf(c_0_41,plain,
( ~ s__disjoint(X1,X2)
| ~ s__instance(X3,X2)
| ~ s__instance(X3,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_37,c_0_22]),c_0_22])]) ).
cnf(c_0_42,negated_conjecture,
s__disjoint(s__NullSet,X1),
inference(spm,[status(thm)],[c_0_38,c_0_39]) ).
cnf(c_0_43,negated_conjecture,
( s__instance(s__Invertebrate,s__Set)
| X1 != s__Human
| ~ s__subclass(X1,s__CognitiveAgent) ),
inference(spm,[status(thm)],[c_0_15,c_0_40]) ).
cnf(c_0_44,negated_conjecture,
( ~ s__instance(X1,s__NullSet)
| ~ s__instance(X1,X2) ),
inference(spm,[status(thm)],[c_0_41,c_0_42]) ).
cnf(c_0_45,negated_conjecture,
s__instance(s__Invertebrate,s__Set),
inference(spm,[status(thm)],[c_0_43,c_0_20]) ).
cnf(c_0_46,negated_conjecture,
( X1 = s__UnionFn(s__NullSet,X2)
| ~ s__instance(esk158_3(X2,X1,s__NullSet),X3) ),
inference(spm,[status(thm)],[c_0_44,c_0_30]) ).
cnf(c_0_47,negated_conjecture,
s__instance(X1,s__Set),
inference(spm,[status(thm)],[c_0_45,c_0_40]) ).
cnf(c_0_48,negated_conjecture,
X1 = s__UnionFn(s__NullSet,X2),
inference(spm,[status(thm)],[c_0_46,c_0_47]) ).
cnf(c_0_49,negated_conjecture,
X1 = X2,
inference(spm,[status(thm)],[c_0_48,c_0_48]) ).
cnf(c_0_50,negated_conjecture,
~ s__subclass(s__Animal,s__CognitiveAgent),
inference(sr,[status(thm)],[c_0_34,c_0_49]) ).
cnf(c_0_51,plain,
s__subclass(s__Animal,s__Organism),
inference(split_conjunct,[status(thm)],[kb_SUMO_5980]) ).
cnf(c_0_52,negated_conjecture,
~ s__subclass(s__Animal,X1),
inference(spm,[status(thm)],[c_0_50,c_0_49]) ).
cnf(c_0_53,plain,
$false,
inference(sr,[status(thm)],[c_0_51,c_0_52]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : CSR083+4 : TPTP v8.2.0. Bugfixed v7.3.0.
% 0.12/0.13 % Command : run_E %s %d THM
% 0.14/0.34 % Computer : n012.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Sun May 19 01:17:23 EDT 2024
% 0.20/0.34 % CPUTime :
% 0.20/0.47 Running first-order model finding
% 0.20/0.47 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/benchmark/theBenchmark.p
% 19.23/3.29 # Version: 3.1.0
% 19.23/3.29 # Preprocessing class: FMLLSMSLSSSNFFN.
% 19.23/3.29 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 19.23/3.29 # Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1500s (5) cores
% 19.23/3.29 # Starting new_bool_3 with 300s (1) cores
% 19.23/3.29 # Starting new_bool_1 with 300s (1) cores
% 19.23/3.29 # Starting sh5l with 300s (1) cores
% 19.23/3.29 # G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with pid 1295 completed with status 0
% 19.23/3.29 # Result found by G-E--_208_B07_F1_AE_CS_SP_PS_S0Y
% 19.23/3.29 # Preprocessing class: FMLLSMSLSSSNFFN.
% 19.23/3.29 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 19.23/3.29 # Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1500s (5) cores
% 19.23/3.29 # No SInE strategy applied
% 19.23/3.29 # Search class: FGHSM-SMLM31-MFFFFFNN
% 19.23/3.29 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 19.23/3.29 # Starting C07_19_nc_SAT001_MinMin_p005000_rr with 811s (1) cores
% 19.23/3.29 # Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 151s (1) cores
% 19.23/3.29 # Starting new_bool_3 with 136s (1) cores
% 19.23/3.29 # Starting new_bool_1 with 136s (1) cores
% 19.23/3.29 # Starting sh5l with 136s (1) cores
% 19.23/3.29 # G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with pid 1307 completed with status 0
% 19.23/3.29 # Result found by G-E--_208_B07_F1_AE_CS_SP_PS_S0Y
% 19.23/3.29 # Preprocessing class: FMLLSMSLSSSNFFN.
% 19.23/3.29 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 19.23/3.29 # Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1500s (5) cores
% 19.23/3.29 # No SInE strategy applied
% 19.23/3.29 # Search class: FGHSM-SMLM31-MFFFFFNN
% 19.23/3.29 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 19.23/3.29 # Starting C07_19_nc_SAT001_MinMin_p005000_rr with 811s (1) cores
% 19.23/3.29 # Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 151s (1) cores
% 19.23/3.29 # Preprocessing time : 0.096 s
% 19.23/3.29 # Presaturation interreduction done
% 19.23/3.29
% 19.23/3.29 # Proof found!
% 19.23/3.29 # SZS status Theorem
% 19.23/3.29 # SZS output start CNFRefutation
% See solution above
% 19.23/3.29 # Parsed axioms : 7218
% 19.23/3.29 # Removed by relevancy pruning/SinE : 0
% 19.23/3.29 # Initial clauses : 8409
% 19.23/3.29 # Removed in clause preprocessing : 63
% 19.23/3.29 # Initial clauses in saturation : 8346
% 19.23/3.29 # Processed clauses : 17616
% 19.23/3.29 # ...of these trivial : 934
% 19.23/3.29 # ...subsumed : 346
% 19.23/3.29 # ...remaining for further processing : 16336
% 19.23/3.29 # Other redundant clauses eliminated : 35
% 19.23/3.29 # Clauses deleted for lack of memory : 0
% 19.23/3.29 # Backward-subsumed : 1115
% 19.23/3.29 # Backward-rewritten : 1472
% 19.23/3.29 # Generated clauses : 107445
% 19.23/3.29 # ...of the previous two non-redundant : 102650
% 19.23/3.29 # ...aggressively subsumed : 0
% 19.23/3.29 # Contextual simplify-reflections : 671
% 19.23/3.29 # Paramodulations : 107361
% 19.23/3.29 # Factorizations : 1
% 19.23/3.29 # NegExts : 0
% 19.23/3.29 # Equation resolutions : 50
% 19.23/3.29 # Disequality decompositions : 0
% 19.23/3.29 # Total rewrite steps : 7308
% 19.23/3.29 # ...of those cached : 4295
% 19.23/3.29 # Propositional unsat checks : 0
% 19.23/3.29 # Propositional check models : 0
% 19.23/3.29 # Propositional check unsatisfiable : 0
% 19.23/3.29 # Propositional clauses : 0
% 19.23/3.29 # Propositional clauses after purity: 0
% 19.23/3.29 # Propositional unsat core size : 0
% 19.23/3.29 # Propositional preprocessing time : 0.000
% 19.23/3.29 # Propositional encoding time : 0.000
% 19.23/3.29 # Propositional solver time : 0.000
% 19.23/3.29 # Success case prop preproc time : 0.000
% 19.23/3.29 # Success case prop encoding time : 0.000
% 19.23/3.29 # Success case prop solver time : 0.000
% 19.23/3.29 # Current number of processed clauses : 5558
% 19.23/3.29 # Positive orientable unit clauses : 3953
% 19.23/3.29 # Positive unorientable unit clauses: 1
% 19.23/3.29 # Negative unit clauses : 18
% 19.23/3.29 # Non-unit-clauses : 1586
% 19.23/3.29 # Current number of unprocessed clauses: 74007
% 19.23/3.29 # ...number of literals in the above : 149410
% 19.23/3.29 # Current number of archived formulas : 0
% 19.23/3.29 # Current number of archived clauses : 10770
% 19.23/3.29 # Clause-clause subsumption calls (NU) : 3194480
% 19.23/3.29 # Rec. Clause-clause subsumption calls : 902963
% 19.23/3.29 # Non-unit clause-clause subsumptions : 1031
% 19.23/3.29 # Unit Clause-clause subsumption calls : 273261
% 19.23/3.29 # Rewrite failures with RHS unbound : 9872
% 19.23/3.29 # BW rewrite match attempts : 33853
% 19.23/3.29 # BW rewrite match successes : 10789
% 19.23/3.29 # Condensation attempts : 0
% 19.23/3.29 # Condensation successes : 0
% 19.23/3.29 # Termbank termtop insertions : 1179841
% 19.23/3.29 # Search garbage collected termcells : 89743
% 19.23/3.29
% 19.23/3.29 # -------------------------------------------------
% 19.23/3.29 # User time : 2.472 s
% 19.23/3.29 # System time : 0.130 s
% 19.23/3.29 # Total time : 2.602 s
% 19.23/3.29 # Maximum resident set size: 29636 pages
% 19.23/3.29
% 19.23/3.29 # -------------------------------------------------
% 19.23/3.29 # User time : 10.777 s
% 19.23/3.29 # System time : 0.285 s
% 19.23/3.29 # Total time : 11.063 s
% 19.23/3.29 # Maximum resident set size: 9056 pages
% 19.23/3.29 % E---3.1 exiting
%------------------------------------------------------------------------------