TSTP Solution File: NUM842+1 by E-SAT---3.2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.2.0
% Problem : NUM842+1 : TPTP v8.2.0. Released v4.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d SAT
% Computer : n025.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 Jun 24 12:49:42 EDT 2024
% Result : Theorem 0.94s 0.60s
% Output : CNFRefutation 0.94s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 13
% Syntax : Number of formulae : 78 ( 33 unt; 0 def)
% Number of atoms : 148 ( 49 equ)
% Maximal formula atoms : 8 ( 1 avg)
% Number of connectives : 129 ( 59 ~; 56 |; 9 &)
% ( 2 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 3 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 4 con; 0-2 aty)
% Number of variables : 138 ( 13 sgn 60 !; 3 ?)
% Comments :
%------------------------------------------------------------------------------
fof('holds(conseq(218), 361, 0)',conjecture,
greater(vplus(vd353,vd355),vplus(vd354,vd356)),
file('/export/starexec/sandbox2/tmp/tmp.DCHNKBK89e/E---3.1_4192.p','holds(conseq(218), 361, 0)') ).
fof('ass(cond(189, 0), 0)',axiom,
! [X11,X12] : greater(vplus(X11,X12),X11),
file('/export/starexec/sandbox2/tmp/tmp.DCHNKBK89e/E---3.1_4192.p','ass(cond(189, 0), 0)') ).
fof('ass(cond(61, 0), 0)',axiom,
! [X51,X52] : vplus(X52,X51) = vplus(X51,X52),
file('/export/starexec/sandbox2/tmp/tmp.DCHNKBK89e/E---3.1_4192.p','ass(cond(61, 0), 0)') ).
fof('ass(cond(209, 0), 0)',axiom,
! [X1,X2,X3,X4] :
( ( greater(X3,X4)
& greater(X1,X2) )
=> greater(vplus(X1,X3),vplus(X2,X4)) ),
file('/export/starexec/sandbox2/tmp/tmp.DCHNKBK89e/E---3.1_4192.p','ass(cond(209, 0), 0)') ).
fof('def(cond(conseq(axiom(3)), 16), 1)',axiom,
! [X28,X29] :
( geq(X29,X28)
<=> ( greater(X29,X28)
| X29 = X28 ) ),
file('/export/starexec/sandbox2/tmp/tmp.DCHNKBK89e/E---3.1_4192.p','def(cond(conseq(axiom(3)), 16), 1)') ).
fof('dis(antec(218))',axiom,
( ( greater(vd355,vd356)
& geq(vd353,vd354) )
| ( geq(vd355,vd356)
& greater(vd353,vd354) ) ),
file('/export/starexec/sandbox2/tmp/tmp.DCHNKBK89e/E---3.1_4192.p','dis(antec(218))') ).
fof('ass(cond(33, 0), 0)',axiom,
! [X56,X57,X58] : vplus(vplus(X56,X57),X58) = vplus(X56,vplus(X57,X58)),
file('/export/starexec/sandbox2/tmp/tmp.DCHNKBK89e/E---3.1_4192.p','ass(cond(33, 0), 0)') ).
fof('ass(cond(goal(88), 0), 1)',axiom,
! [X42,X43] :
( X42 != X43
| ~ ? [X45] : X43 = vplus(X42,X45) ),
file('/export/starexec/sandbox2/tmp/tmp.DCHNKBK89e/E---3.1_4192.p','ass(cond(goal(88), 0), 1)') ).
fof('def(cond(conseq(axiom(3)), 11), 1)',axiom,
! [X39,X40] :
( greater(X40,X39)
<=> ? [X41] : X40 = vplus(X39,X41) ),
file('/export/starexec/sandbox2/tmp/tmp.DCHNKBK89e/E---3.1_4192.p','def(cond(conseq(axiom(3)), 11), 1)') ).
fof('ass(cond(goal(130), 0), 3)',axiom,
! [X34,X35] :
( X34 != X35
| ~ greater(X34,X35) ),
file('/export/starexec/sandbox2/tmp/tmp.DCHNKBK89e/E---3.1_4192.p','ass(cond(goal(130), 0), 3)') ).
fof('ass(cond(goal(193), 0), 2)',axiom,
! [X8,X9,X10] :
( greater(X8,X9)
=> greater(vplus(X8,X10),vplus(X9,X10)) ),
file('/export/starexec/sandbox2/tmp/tmp.DCHNKBK89e/E---3.1_4192.p','ass(cond(goal(193), 0), 2)') ).
fof('ass(cond(147, 0), 0)',axiom,
! [X30,X31] :
( less(X30,X31)
=> greater(X31,X30) ),
file('/export/starexec/sandbox2/tmp/tmp.DCHNKBK89e/E---3.1_4192.p','ass(cond(147, 0), 0)') ).
fof('ass(cond(goal(130), 0), 0)',axiom,
! [X34,X35] :
( X34 = X35
| greater(X34,X35)
| less(X34,X35) ),
file('/export/starexec/sandbox2/tmp/tmp.DCHNKBK89e/E---3.1_4192.p','ass(cond(goal(130), 0), 0)') ).
fof(c_0_13,negated_conjecture,
~ greater(vplus(vd353,vd355),vplus(vd354,vd356)),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],['holds(conseq(218), 361, 0)'])]) ).
fof(c_0_14,plain,
! [X78,X79] : greater(vplus(X78,X79),X78),
inference(variable_rename,[status(thm)],['ass(cond(189, 0), 0)']) ).
fof(c_0_15,plain,
! [X121,X122] : vplus(X122,X121) = vplus(X121,X122),
inference(variable_rename,[status(thm)],['ass(cond(61, 0), 0)']) ).
fof(c_0_16,negated_conjecture,
~ greater(vplus(vd353,vd355),vplus(vd354,vd356)),
inference(fof_nnf,[status(thm)],[c_0_13]) ).
fof(c_0_17,plain,
! [X68,X69,X70,X71] :
( ~ greater(X70,X71)
| ~ greater(X68,X69)
| greater(vplus(X68,X70),vplus(X69,X71)) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],['ass(cond(209, 0), 0)'])])]) ).
fof(c_0_18,plain,
! [X147,X148] :
( ( ~ geq(X148,X147)
| greater(X148,X147)
| X148 = X147 )
& ( ~ greater(X148,X147)
| geq(X148,X147) )
& ( X148 != X147
| geq(X148,X147) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],['def(cond(conseq(axiom(3)), 16), 1)'])])])]) ).
fof(c_0_19,plain,
( ( geq(vd355,vd356)
| greater(vd355,vd356) )
& ( greater(vd353,vd354)
| greater(vd355,vd356) )
& ( geq(vd355,vd356)
| geq(vd353,vd354) )
& ( greater(vd353,vd354)
| geq(vd353,vd354) ) ),
inference(distribute,[status(thm)],['dis(antec(218))']) ).
cnf(c_0_20,plain,
greater(vplus(X1,X2),X1),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_21,plain,
vplus(X1,X2) = vplus(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
fof(c_0_22,plain,
! [X123,X124,X125] : vplus(vplus(X123,X124),X125) = vplus(X123,vplus(X124,X125)),
inference(variable_rename,[status(thm)],['ass(cond(33, 0), 0)']) ).
cnf(c_0_23,negated_conjecture,
~ greater(vplus(vd353,vd355),vplus(vd354,vd356)),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_24,plain,
( greater(vplus(X3,X1),vplus(X4,X2))
| ~ greater(X1,X2)
| ~ greater(X3,X4) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_25,plain,
( greater(X1,X2)
| X1 = X2
| ~ geq(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_26,plain,
( geq(vd355,vd356)
| greater(vd355,vd356) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_27,plain,
greater(vplus(X1,X2),X2),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_28,plain,
vplus(vplus(X1,X2),X3) = vplus(X1,vplus(X2,X3)),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_29,negated_conjecture,
( ~ greater(vd353,vd354)
| ~ greater(vd355,vd356) ),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_30,plain,
( vd356 = vd355
| greater(vd355,vd356) ),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_31,plain,
( greater(vd353,vd354)
| geq(vd353,vd354) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
fof(c_0_32,plain,
! [X42,X43] :
( X42 != X43
| ~ ? [X45] : X43 = vplus(X42,X45) ),
inference(fof_simplification,[status(thm)],['ass(cond(goal(88), 0), 1)']) ).
cnf(c_0_33,plain,
greater(vplus(X1,vplus(X2,X3)),X3),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
fof(c_0_34,plain,
! [X90,X91,X93,X94,X95] :
( ( ~ greater(X91,X90)
| X91 = vplus(X90,esk1_2(X90,X91)) )
& ( X94 != vplus(X93,X95)
| greater(X94,X93) ) ),
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)],['def(cond(conseq(axiom(3)), 11), 1)'])])])])])]) ).
cnf(c_0_35,negated_conjecture,
( vd356 = vd355
| ~ greater(vd353,vd354) ),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_36,plain,
( vd354 = vd353
| greater(vd353,vd354) ),
inference(spm,[status(thm)],[c_0_25,c_0_31]) ).
fof(c_0_37,plain,
! [X34,X35] :
( X34 != X35
| ~ greater(X34,X35) ),
inference(fof_simplification,[status(thm)],['ass(cond(goal(130), 0), 3)']) ).
fof(c_0_38,plain,
! [X106,X107,X108] :
( X106 != X107
| X107 != vplus(X106,X108) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_32])])])]) ).
cnf(c_0_39,plain,
greater(vplus(X1,vplus(X2,X3)),X2),
inference(spm,[status(thm)],[c_0_33,c_0_21]) ).
cnf(c_0_40,plain,
( X1 = vplus(X2,esk1_2(X2,X1))
| ~ greater(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_34]) ).
cnf(c_0_41,negated_conjecture,
( vd354 = vd353
| vd356 = vd355 ),
inference(spm,[status(thm)],[c_0_35,c_0_36]) ).
fof(c_0_42,plain,
! [X75,X76,X77] :
( ~ greater(X75,X76)
| greater(vplus(X75,X77),vplus(X76,X77)) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],['ass(cond(goal(193), 0), 2)'])])]) ).
fof(c_0_43,plain,
! [X88,X89] :
( X88 != X89
| ~ greater(X88,X89) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_37])]) ).
cnf(c_0_44,plain,
( X1 != X2
| X2 != vplus(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_38]) ).
cnf(c_0_45,plain,
( greater(vplus(X1,X2),X3)
| ~ greater(X2,X3) ),
inference(spm,[status(thm)],[c_0_39,c_0_40]) ).
cnf(c_0_46,negated_conjecture,
( vd354 = vd353
| ~ greater(vplus(vd353,vd355),vplus(vd354,vd355)) ),
inference(spm,[status(thm)],[c_0_23,c_0_41]) ).
cnf(c_0_47,plain,
( greater(vplus(X1,X3),vplus(X2,X3))
| ~ greater(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_42]) ).
cnf(c_0_48,plain,
( X1 != X2
| ~ greater(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_43]) ).
cnf(c_0_49,plain,
vplus(X1,X2) != X1,
inference(er,[status(thm)],[c_0_44]) ).
cnf(c_0_50,plain,
( greater(vplus(X1,X2),X3)
| ~ greater(X1,X3) ),
inference(spm,[status(thm)],[c_0_45,c_0_21]) ).
cnf(c_0_51,plain,
( greater(vd353,vd354)
| greater(vd355,vd356) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_52,negated_conjecture,
vd354 = vd353,
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_47]),c_0_36]) ).
cnf(c_0_53,plain,
~ greater(X1,X1),
inference(er,[status(thm)],[c_0_48]) ).
cnf(c_0_54,plain,
vplus(X1,vplus(X2,X3)) != vplus(X1,X2),
inference(spm,[status(thm)],[c_0_49,c_0_28]) ).
cnf(c_0_55,plain,
( greater(X1,X2)
| ~ greater(X3,X2)
| ~ greater(X1,X3) ),
inference(spm,[status(thm)],[c_0_50,c_0_40]) ).
cnf(c_0_56,plain,
greater(vd355,vd356),
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_51,c_0_52]),c_0_53]) ).
cnf(c_0_57,plain,
( vplus(X1,X2) != vplus(X1,X3)
| ~ greater(X2,X3) ),
inference(spm,[status(thm)],[c_0_54,c_0_40]) ).
cnf(c_0_58,plain,
( greater(X1,vd356)
| ~ greater(X1,vd355) ),
inference(spm,[status(thm)],[c_0_55,c_0_56]) ).
cnf(c_0_59,plain,
( vplus(X1,X2) != vplus(X1,vd356)
| ~ greater(X2,vd355) ),
inference(spm,[status(thm)],[c_0_57,c_0_58]) ).
cnf(c_0_60,plain,
vplus(X1,vd356) != vplus(X1,vd355),
inference(spm,[status(thm)],[c_0_57,c_0_56]) ).
cnf(c_0_61,plain,
vplus(X1,vplus(vd355,X2)) != vplus(X1,vd356),
inference(spm,[status(thm)],[c_0_59,c_0_20]) ).
cnf(c_0_62,plain,
vplus(X1,vplus(X2,X3)) = vplus(X2,vplus(X1,X3)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_21]),c_0_28]) ).
fof(c_0_63,plain,
! [X80,X81] :
( ~ less(X80,X81)
| greater(X81,X80) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],['ass(cond(147, 0), 0)'])])]) ).
fof(c_0_64,plain,
! [X84,X85] :
( X84 = X85
| greater(X84,X85)
| less(X84,X85) ),
inference(variable_rename,[status(thm)],['ass(cond(goal(130), 0), 0)']) ).
cnf(c_0_65,plain,
vplus(vd356,X1) != vplus(X1,vd355),
inference(spm,[status(thm)],[c_0_60,c_0_21]) ).
cnf(c_0_66,plain,
vplus(vd355,vplus(X1,X2)) != vplus(X1,vd356),
inference(spm,[status(thm)],[c_0_61,c_0_62]) ).
cnf(c_0_67,plain,
( vplus(X1,vplus(X2,esk1_2(vplus(X1,X2),X3))) = X3
| ~ greater(X3,vplus(X1,X2)) ),
inference(spm,[status(thm)],[c_0_28,c_0_40]) ).
cnf(c_0_68,plain,
( greater(X2,X1)
| ~ less(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_63]) ).
cnf(c_0_69,plain,
( X1 = X2
| greater(X1,X2)
| less(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_64]) ).
cnf(c_0_70,plain,
vplus(vd356,X1) != vplus(vd355,X1),
inference(spm,[status(thm)],[c_0_65,c_0_21]) ).
cnf(c_0_71,plain,
~ greater(vplus(X1,vd356),vplus(vd355,X1)),
inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_66,c_0_67])]) ).
cnf(c_0_72,plain,
( X1 = X2
| greater(X1,X2)
| greater(X2,X1) ),
inference(spm,[status(thm)],[c_0_68,c_0_69]) ).
cnf(c_0_73,plain,
vplus(X1,vd356) != vplus(vd355,X1),
inference(spm,[status(thm)],[c_0_70,c_0_21]) ).
cnf(c_0_74,plain,
greater(vplus(vd355,X1),vplus(X1,vd356)),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_71,c_0_72]),c_0_73]) ).
cnf(c_0_75,negated_conjecture,
~ greater(vplus(vd353,vd355),vplus(vd353,vd356)),
inference(spm,[status(thm)],[c_0_23,c_0_52]) ).
cnf(c_0_76,plain,
greater(vplus(X1,vd355),vplus(X1,vd356)),
inference(spm,[status(thm)],[c_0_74,c_0_21]) ).
cnf(c_0_77,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_75,c_0_76])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : NUM842+1 : TPTP v8.2.0. Released v4.1.0.
% 0.10/0.12 % Command : run_E %s %d SAT
% 0.12/0.33 % Computer : n025.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Sat Jun 22 19:09:24 EDT 2024
% 0.12/0.33 % CPUTime :
% 0.21/0.48 Running first-order model finding
% 0.21/0.48 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.DCHNKBK89e/E---3.1_4192.p
% 0.94/0.60 # Version: 3.2.0
% 0.94/0.60 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.94/0.60 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.94/0.60 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.94/0.60 # Starting new_bool_3 with 300s (1) cores
% 0.94/0.60 # Starting new_bool_1 with 300s (1) cores
% 0.94/0.60 # Starting sh5l with 300s (1) cores
% 0.94/0.60 # new_bool_1 with pid 4271 completed with status 0
% 0.94/0.60 # Result found by new_bool_1
% 0.94/0.60 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.94/0.60 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.94/0.60 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.94/0.60 # Starting new_bool_3 with 300s (1) cores
% 0.94/0.60 # Starting new_bool_1 with 300s (1) cores
% 0.94/0.60 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.94/0.60 # Search class: FGHSS-FFMS22-SFFFFFNN
% 0.94/0.60 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.94/0.60 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.94/0.60 # SAT001_MinMin_p005000_rr_RG with pid 4274 completed with status 0
% 0.94/0.60 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.94/0.60 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.94/0.60 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.94/0.60 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.94/0.60 # Starting new_bool_3 with 300s (1) cores
% 0.94/0.60 # Starting new_bool_1 with 300s (1) cores
% 0.94/0.60 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.94/0.60 # Search class: FGHSS-FFMS22-SFFFFFNN
% 0.94/0.60 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.94/0.60 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.94/0.60 # Preprocessing time : 0.002 s
% 0.94/0.60 # Presaturation interreduction done
% 0.94/0.60
% 0.94/0.60 # Proof found!
% 0.94/0.60 # SZS status Theorem
% 0.94/0.60 # SZS output start CNFRefutation
% See solution above
% 0.94/0.60 # Parsed axioms : 41
% 0.94/0.60 # Removed by relevancy pruning/SinE : 8
% 0.94/0.60 # Initial clauses : 43
% 0.94/0.60 # Removed in clause preprocessing : 1
% 0.94/0.60 # Initial clauses in saturation : 42
% 0.94/0.60 # Processed clauses : 1602
% 0.94/0.60 # ...of these trivial : 34
% 0.94/0.60 # ...subsumed : 1170
% 0.94/0.60 # ...remaining for further processing : 398
% 0.94/0.60 # Other redundant clauses eliminated : 58
% 0.94/0.60 # Clauses deleted for lack of memory : 0
% 0.94/0.60 # Backward-subsumed : 8
% 0.94/0.60 # Backward-rewritten : 25
% 0.94/0.60 # Generated clauses : 6287
% 0.94/0.60 # ...of the previous two non-redundant : 5905
% 0.94/0.60 # ...aggressively subsumed : 0
% 0.94/0.60 # Contextual simplify-reflections : 2
% 0.94/0.60 # Paramodulations : 6223
% 0.94/0.60 # Factorizations : 2
% 0.94/0.60 # NegExts : 0
% 0.94/0.60 # Equation resolutions : 62
% 0.94/0.60 # Disequality decompositions : 0
% 0.94/0.60 # Total rewrite steps : 1600
% 0.94/0.60 # ...of those cached : 1215
% 0.94/0.60 # Propositional unsat checks : 0
% 0.94/0.60 # Propositional check models : 0
% 0.94/0.60 # Propositional check unsatisfiable : 0
% 0.94/0.60 # Propositional clauses : 0
% 0.94/0.60 # Propositional clauses after purity: 0
% 0.94/0.60 # Propositional unsat core size : 0
% 0.94/0.60 # Propositional preprocessing time : 0.000
% 0.94/0.60 # Propositional encoding time : 0.000
% 0.94/0.60 # Propositional solver time : 0.000
% 0.94/0.60 # Success case prop preproc time : 0.000
% 0.94/0.60 # Success case prop encoding time : 0.000
% 0.94/0.60 # Success case prop solver time : 0.000
% 0.94/0.60 # Current number of processed clauses : 317
% 0.94/0.60 # Positive orientable unit clauses : 35
% 0.94/0.60 # Positive unorientable unit clauses: 3
% 0.94/0.60 # Negative unit clauses : 91
% 0.94/0.60 # Non-unit-clauses : 188
% 0.94/0.60 # Current number of unprocessed clauses: 4366
% 0.94/0.60 # ...number of literals in the above : 9116
% 0.94/0.60 # Current number of archived formulas : 0
% 0.94/0.60 # Current number of archived clauses : 72
% 0.94/0.60 # Clause-clause subsumption calls (NU) : 7333
% 0.94/0.60 # Rec. Clause-clause subsumption calls : 6372
% 0.94/0.60 # Non-unit clause-clause subsumptions : 410
% 0.94/0.60 # Unit Clause-clause subsumption calls : 2218
% 0.94/0.60 # Rewrite failures with RHS unbound : 0
% 0.94/0.60 # BW rewrite match attempts : 113
% 0.94/0.60 # BW rewrite match successes : 66
% 0.94/0.60 # Condensation attempts : 0
% 0.94/0.60 # Condensation successes : 0
% 0.94/0.60 # Termbank termtop insertions : 51962
% 0.94/0.60 # Search garbage collected termcells : 581
% 0.94/0.60
% 0.94/0.60 # -------------------------------------------------
% 0.94/0.60 # User time : 0.099 s
% 0.94/0.60 # System time : 0.005 s
% 0.94/0.60 # Total time : 0.104 s
% 0.94/0.60 # Maximum resident set size: 1912 pages
% 0.94/0.60
% 0.94/0.60 # -------------------------------------------------
% 0.94/0.60 # User time : 0.101 s
% 0.94/0.60 # System time : 0.007 s
% 0.94/0.60 # Total time : 0.108 s
% 0.94/0.60 # Maximum resident set size: 1760 pages
% 0.94/0.60 % E---3.1 exiting
% 1.14/0.60 % E exiting
%------------------------------------------------------------------------------