TSTP Solution File: SWC200+1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : SWC200+1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n026.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:42:00 EDT 2023
% Result : Theorem 0.46s 0.52s
% Output : CNFRefutation 0.46s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 11
% Syntax : Number of formulae : 61 ( 14 unt; 0 def)
% Number of atoms : 223 ( 64 equ)
% Maximal formula atoms : 16 ( 3 avg)
% Number of connectives : 272 ( 110 ~; 108 |; 22 &)
% ( 2 <=>; 30 =>; 0 <=; 0 <~>)
% Maximal formula depth : 19 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 5 con; 0-2 aty)
% Number of variables : 88 ( 0 sgn; 49 !; 5 ?)
% Comments :
%------------------------------------------------------------------------------
fof(ax18,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> cons(X2,X1) != X1 ) ),
file('/export/starexec/sandbox/tmp/tmp.U4XX7QK8a0/E---3.1_14840.p',ax18) ).
fof(ax27,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssItem(X3)
=> cons(X3,app(X2,X1)) = app(cons(X3,X2),X1) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.U4XX7QK8a0/E---3.1_14840.p',ax27) ).
fof(ax26,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ssList(app(X1,X2)) ) ),
file('/export/starexec/sandbox/tmp/tmp.U4XX7QK8a0/E---3.1_14840.p',ax26) ).
fof(ax4,axiom,
! [X1] :
( ssList(X1)
=> ( singletonP(X1)
<=> ? [X2] :
( ssItem(X2)
& cons(X2,nil) = X1 ) ) ),
file('/export/starexec/sandbox/tmp/tmp.U4XX7QK8a0/E---3.1_14840.p',ax4) ).
fof(co1,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ~ singletonP(X3)
| ? [X5] :
( ssItem(X5)
& ! [X6] :
( ssItem(X6)
=> ( ~ memberP(X1,X6)
| X5 = X6 ) ) ) ) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.U4XX7QK8a0/E---3.1_14840.p',co1) ).
fof(ax17,axiom,
ssList(nil),
file('/export/starexec/sandbox/tmp/tmp.U4XX7QK8a0/E---3.1_14840.p',ax17) ).
fof(ax84,axiom,
! [X1] :
( ssList(X1)
=> app(X1,nil) = X1 ),
file('/export/starexec/sandbox/tmp/tmp.U4XX7QK8a0/E---3.1_14840.p',ax84) ).
fof(ax20,axiom,
! [X1] :
( ssList(X1)
=> ( nil = X1
| ? [X2] :
( ssList(X2)
& ? [X3] :
( ssItem(X3)
& cons(X3,X2) = X1 ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.U4XX7QK8a0/E---3.1_14840.p',ax20) ).
fof(ax19,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssItem(X3)
=> ! [X4] :
( ssItem(X4)
=> ( cons(X3,X1) = cons(X4,X2)
=> ( X3 = X4
& X2 = X1 ) ) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.U4XX7QK8a0/E---3.1_14840.p',ax19) ).
fof(ax38,axiom,
! [X1] :
( ssItem(X1)
=> ~ memberP(nil,X1) ),
file('/export/starexec/sandbox/tmp/tmp.U4XX7QK8a0/E---3.1_14840.p',ax38) ).
fof(ax37,axiom,
! [X1] :
( ssItem(X1)
=> ! [X2] :
( ssItem(X2)
=> ! [X3] :
( ssList(X3)
=> ( memberP(cons(X2,X3),X1)
<=> ( X1 = X2
| memberP(X3,X1) ) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.U4XX7QK8a0/E---3.1_14840.p',ax37) ).
fof(c_0_11,plain,
! [X53,X54] :
( ~ ssList(X53)
| ~ ssItem(X54)
| cons(X54,X53) != X53 ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax18])])]) ).
fof(c_0_12,plain,
! [X33,X34,X35] :
( ~ ssList(X33)
| ~ ssList(X34)
| ~ ssItem(X35)
| cons(X35,app(X34,X33)) = app(cons(X35,X34),X33) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax27])])]) ).
fof(c_0_13,plain,
! [X31,X32] :
( ~ ssList(X31)
| ~ ssList(X32)
| ssList(app(X31,X32)) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax26])])]) ).
cnf(c_0_14,plain,
( ~ ssList(X1)
| ~ ssItem(X2)
| cons(X2,X1) != X1 ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_15,plain,
( cons(X3,app(X2,X1)) = app(cons(X3,X2),X1)
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssItem(X3) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_16,plain,
( ssList(app(X1,X2))
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
fof(c_0_17,plain,
! [X28,X30] :
( ( ssItem(esk10_1(X28))
| ~ singletonP(X28)
| ~ ssList(X28) )
& ( cons(esk10_1(X28),nil) = X28
| ~ singletonP(X28)
| ~ ssList(X28) )
& ( ~ ssItem(X30)
| cons(X30,nil) != X28
| singletonP(X28)
| ~ ssList(X28) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax4])])])])]) ).
fof(c_0_18,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ~ singletonP(X3)
| ? [X5] :
( ssItem(X5)
& ! [X6] :
( ssItem(X6)
=> ( ~ memberP(X1,X6)
| X5 = X6 ) ) ) ) ) ) ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[co1])]) ).
cnf(c_0_19,plain,
( app(cons(X1,X2),X3) != app(X2,X3)
| ~ ssList(X2)
| ~ ssList(X3)
| ~ ssItem(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_16]) ).
cnf(c_0_20,plain,
( cons(esk10_1(X1),nil) = X1
| ~ singletonP(X1)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_21,plain,
ssList(nil),
inference(split_conjunct,[status(thm)],[ax17]) ).
cnf(c_0_22,plain,
( ssItem(esk10_1(X1))
| ~ singletonP(X1)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
fof(c_0_23,plain,
! [X50] :
( ~ ssList(X50)
| app(X50,nil) = X50 ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax84])]) ).
fof(c_0_24,negated_conjecture,
! [X11] :
( ssList(esk1_0)
& ssList(esk2_0)
& ssList(esk3_0)
& ssList(esk4_0)
& esk2_0 = esk4_0
& esk1_0 = esk3_0
& singletonP(esk3_0)
& ( ssItem(esk5_1(X11))
| ~ ssItem(X11) )
& ( memberP(esk1_0,esk5_1(X11))
| ~ ssItem(X11) )
& ( X11 != esk5_1(X11)
| ~ ssItem(X11) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_18])])])])]) ).
cnf(c_0_25,plain,
( app(X1,X2) != app(nil,X2)
| ~ singletonP(X1)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_21])]),c_0_22]) ).
cnf(c_0_26,plain,
( app(X1,nil) = X1
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_27,negated_conjecture,
singletonP(esk3_0),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_28,negated_conjecture,
esk1_0 = esk3_0,
inference(split_conjunct,[status(thm)],[c_0_24]) ).
fof(c_0_29,plain,
! [X59] :
( ( ssList(esk11_1(X59))
| nil = X59
| ~ ssList(X59) )
& ( ssItem(esk12_1(X59))
| nil = X59
| ~ ssList(X59) )
& ( cons(esk12_1(X59),esk11_1(X59)) = X59
| nil = X59
| ~ ssList(X59) ) ),
inference(distribute,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax20])])])]) ).
cnf(c_0_30,plain,
( app(X1,nil) != nil
| ~ singletonP(X1)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_21])]) ).
cnf(c_0_31,negated_conjecture,
singletonP(esk1_0),
inference(rw,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_32,negated_conjecture,
ssList(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_33,plain,
( cons(esk12_1(X1),esk11_1(X1)) = X1
| nil = X1
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_29]) ).
cnf(c_0_34,negated_conjecture,
app(esk1_0,nil) != nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_32])]) ).
cnf(c_0_35,plain,
( ssList(esk11_1(X1))
| nil = X1
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_29]) ).
cnf(c_0_36,plain,
( ssItem(esk12_1(X1))
| nil = X1
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_29]) ).
fof(c_0_37,plain,
! [X55,X56,X57,X58] :
( ( X57 = X58
| cons(X57,X55) != cons(X58,X56)
| ~ ssItem(X58)
| ~ ssItem(X57)
| ~ ssList(X56)
| ~ ssList(X55) )
& ( X56 = X55
| cons(X57,X55) != cons(X58,X56)
| ~ ssItem(X58)
| ~ ssItem(X57)
| ~ ssList(X56)
| ~ ssList(X55) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax19])])])]) ).
cnf(c_0_38,negated_conjecture,
( cons(esk12_1(esk1_0),esk11_1(esk1_0)) = esk1_0
| esk1_0 = nil ),
inference(spm,[status(thm)],[c_0_33,c_0_32]) ).
cnf(c_0_39,negated_conjecture,
esk1_0 != nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_26]),c_0_32])]) ).
cnf(c_0_40,negated_conjecture,
( esk1_0 = nil
| ssList(esk11_1(esk1_0)) ),
inference(spm,[status(thm)],[c_0_35,c_0_32]) ).
cnf(c_0_41,negated_conjecture,
( esk1_0 = nil
| ssItem(esk12_1(esk1_0)) ),
inference(spm,[status(thm)],[c_0_36,c_0_32]) ).
cnf(c_0_42,plain,
( X1 = X2
| cons(X1,X3) != cons(X2,X4)
| ~ ssItem(X2)
| ~ ssItem(X1)
| ~ ssList(X4)
| ~ ssList(X3) ),
inference(split_conjunct,[status(thm)],[c_0_37]) ).
cnf(c_0_43,negated_conjecture,
cons(esk12_1(esk1_0),esk11_1(esk1_0)) = esk1_0,
inference(sr,[status(thm)],[c_0_38,c_0_39]) ).
cnf(c_0_44,negated_conjecture,
ssList(esk11_1(esk1_0)),
inference(sr,[status(thm)],[c_0_40,c_0_39]) ).
cnf(c_0_45,negated_conjecture,
ssItem(esk12_1(esk1_0)),
inference(sr,[status(thm)],[c_0_41,c_0_39]) ).
cnf(c_0_46,negated_conjecture,
( X1 = esk12_1(esk1_0)
| cons(X1,X2) != esk1_0
| ~ ssList(X2)
| ~ ssItem(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_43]),c_0_44]),c_0_45])]) ).
cnf(c_0_47,negated_conjecture,
( esk10_1(esk1_0) = esk12_1(esk1_0)
| ~ ssItem(esk10_1(esk1_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_20]),c_0_21])])]),c_0_31]),c_0_32])]) ).
fof(c_0_48,plain,
! [X1] :
( ssItem(X1)
=> ~ memberP(nil,X1) ),
inference(fof_simplification,[status(thm)],[ax38]) ).
fof(c_0_49,plain,
! [X22,X23,X24] :
( ( ~ memberP(cons(X23,X24),X22)
| X22 = X23
| memberP(X24,X22)
| ~ ssList(X24)
| ~ ssItem(X23)
| ~ ssItem(X22) )
& ( X22 != X23
| memberP(cons(X23,X24),X22)
| ~ ssList(X24)
| ~ ssItem(X23)
| ~ ssItem(X22) )
& ( ~ memberP(X24,X22)
| memberP(cons(X23,X24),X22)
| ~ ssList(X24)
| ~ ssItem(X23)
| ~ ssItem(X22) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax37])])])]) ).
cnf(c_0_50,negated_conjecture,
esk10_1(esk1_0) = esk12_1(esk1_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_22]),c_0_31]),c_0_32])]) ).
fof(c_0_51,plain,
! [X25] :
( ~ ssItem(X25)
| ~ memberP(nil,X25) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_48])]) ).
cnf(c_0_52,plain,
( X3 = X1
| memberP(X2,X3)
| ~ memberP(cons(X1,X2),X3)
| ~ ssList(X2)
| ~ ssItem(X1)
| ~ ssItem(X3) ),
inference(split_conjunct,[status(thm)],[c_0_49]) ).
cnf(c_0_53,negated_conjecture,
cons(esk12_1(esk1_0),nil) = esk1_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_50]),c_0_31]),c_0_32])]) ).
cnf(c_0_54,plain,
( ~ ssItem(X1)
| ~ memberP(nil,X1) ),
inference(split_conjunct,[status(thm)],[c_0_51]) ).
cnf(c_0_55,negated_conjecture,
( esk12_1(esk1_0) = X1
| ~ memberP(esk1_0,X1)
| ~ ssItem(X1) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_53]),c_0_21]),c_0_45])]),c_0_54]) ).
cnf(c_0_56,negated_conjecture,
( memberP(esk1_0,esk5_1(X1))
| ~ ssItem(X1) ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_57,negated_conjecture,
( ssItem(esk5_1(X1))
| ~ ssItem(X1) ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_58,negated_conjecture,
( X1 != esk5_1(X1)
| ~ ssItem(X1) ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_59,negated_conjecture,
( esk12_1(esk1_0) = esk5_1(X1)
| ~ ssItem(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_55,c_0_56]),c_0_57]) ).
cnf(c_0_60,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_58,c_0_59])]),c_0_45])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SWC200+1 : TPTP v8.1.2. Released v2.4.0.
% 0.07/0.13 % Command : run_E %s %d THM
% 0.13/0.35 % Computer : n026.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 2400
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Tue Oct 3 02:15:44 EDT 2023
% 0.13/0.35 % CPUTime :
% 0.20/0.48 Running first-order model finding
% 0.20/0.48 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.U4XX7QK8a0/E---3.1_14840.p
% 0.46/0.52 # Version: 3.1pre001
% 0.46/0.52 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.46/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.46/0.52 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.46/0.52 # Starting new_bool_3 with 300s (1) cores
% 0.46/0.52 # Starting new_bool_1 with 300s (1) cores
% 0.46/0.52 # Starting sh5l with 300s (1) cores
% 0.46/0.52 # new_bool_3 with pid 14944 completed with status 0
% 0.46/0.52 # Result found by new_bool_3
% 0.46/0.52 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.46/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.46/0.52 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.46/0.52 # Starting new_bool_3 with 300s (1) cores
% 0.46/0.52 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.46/0.52 # Search class: FGHSF-FFMM21-MFFFFFNN
% 0.46/0.52 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.46/0.52 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 0.46/0.52 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 14949 completed with status 0
% 0.46/0.52 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.46/0.52 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.46/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.46/0.52 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.46/0.52 # Starting new_bool_3 with 300s (1) cores
% 0.46/0.52 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.46/0.52 # Search class: FGHSF-FFMM21-MFFFFFNN
% 0.46/0.52 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.46/0.52 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 0.46/0.52 # Preprocessing time : 0.002 s
% 0.46/0.52 # Presaturation interreduction done
% 0.46/0.52
% 0.46/0.52 # Proof found!
% 0.46/0.52 # SZS status Theorem
% 0.46/0.52 # SZS output start CNFRefutation
% See solution above
% 0.46/0.52 # Parsed axioms : 96
% 0.46/0.52 # Removed by relevancy pruning/SinE : 73
% 0.46/0.52 # Initial clauses : 48
% 0.46/0.52 # Removed in clause preprocessing : 0
% 0.46/0.52 # Initial clauses in saturation : 48
% 0.46/0.52 # Processed clauses : 282
% 0.46/0.52 # ...of these trivial : 4
% 0.46/0.52 # ...subsumed : 88
% 0.46/0.52 # ...remaining for further processing : 190
% 0.46/0.52 # Other redundant clauses eliminated : 28
% 0.46/0.52 # Clauses deleted for lack of memory : 0
% 0.46/0.52 # Backward-subsumed : 4
% 0.46/0.52 # Backward-rewritten : 15
% 0.46/0.52 # Generated clauses : 557
% 0.46/0.52 # ...of the previous two non-redundant : 466
% 0.46/0.52 # ...aggressively subsumed : 0
% 0.46/0.52 # Contextual simplify-reflections : 38
% 0.46/0.52 # Paramodulations : 519
% 0.46/0.52 # Factorizations : 0
% 0.46/0.52 # NegExts : 0
% 0.46/0.52 # Equation resolutions : 33
% 0.46/0.52 # Total rewrite steps : 439
% 0.46/0.52 # Propositional unsat checks : 0
% 0.46/0.52 # Propositional check models : 0
% 0.46/0.52 # Propositional check unsatisfiable : 0
% 0.46/0.52 # Propositional clauses : 0
% 0.46/0.52 # Propositional clauses after purity: 0
% 0.46/0.52 # Propositional unsat core size : 0
% 0.46/0.52 # Propositional preprocessing time : 0.000
% 0.46/0.52 # Propositional encoding time : 0.000
% 0.46/0.52 # Propositional solver time : 0.000
% 0.46/0.52 # Success case prop preproc time : 0.000
% 0.46/0.52 # Success case prop encoding time : 0.000
% 0.46/0.52 # Success case prop solver time : 0.000
% 0.46/0.52 # Current number of processed clauses : 115
% 0.46/0.52 # Positive orientable unit clauses : 15
% 0.46/0.52 # Positive unorientable unit clauses: 0
% 0.46/0.52 # Negative unit clauses : 3
% 0.46/0.52 # Non-unit-clauses : 97
% 0.46/0.52 # Current number of unprocessed clauses: 259
% 0.46/0.52 # ...number of literals in the above : 1285
% 0.46/0.52 # Current number of archived formulas : 0
% 0.46/0.52 # Current number of archived clauses : 71
% 0.46/0.52 # Clause-clause subsumption calls (NU) : 1724
% 0.46/0.52 # Rec. Clause-clause subsumption calls : 672
% 0.46/0.52 # Non-unit clause-clause subsumptions : 78
% 0.46/0.52 # Unit Clause-clause subsumption calls : 48
% 0.46/0.52 # Rewrite failures with RHS unbound : 0
% 0.46/0.52 # BW rewrite match attempts : 3
% 0.46/0.52 # BW rewrite match successes : 3
% 0.46/0.52 # Condensation attempts : 0
% 0.46/0.52 # Condensation successes : 0
% 0.46/0.52 # Termbank termtop insertions : 12621
% 0.46/0.52
% 0.46/0.52 # -------------------------------------------------
% 0.46/0.52 # User time : 0.025 s
% 0.46/0.52 # System time : 0.001 s
% 0.46/0.52 # Total time : 0.026 s
% 0.46/0.52 # Maximum resident set size: 2036 pages
% 0.46/0.52
% 0.46/0.52 # -------------------------------------------------
% 0.46/0.52 # User time : 0.028 s
% 0.46/0.52 # System time : 0.004 s
% 0.46/0.52 # Total time : 0.032 s
% 0.46/0.52 # Maximum resident set size: 1792 pages
% 0.46/0.52 % E---3.1 exiting
%------------------------------------------------------------------------------