TSTP Solution File: SWC149+1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : SWC149+1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n016.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:41:45 EDT 2023
% Result : Theorem 0.71s 0.57s
% Output : CNFRefutation 0.71s
% Verified :
% SZS Type : Refutation
% Derivation depth : 19
% Number of leaves : 9
% Syntax : Number of formulae : 59 ( 9 unt; 0 def)
% Number of atoms : 212 ( 59 equ)
% Maximal formula atoms : 12 ( 3 avg)
% Number of connectives : 260 ( 107 ~; 108 |; 22 &)
% ( 2 <=>; 21 =>; 0 <=; 0 <~>)
% Maximal formula depth : 20 ( 5 avg)
% Maximal term depth : 4 ( 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 : 93 ( 0 sgn; 38 !; 9 ?)
% Comments :
%------------------------------------------------------------------------------
fof(ax23,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> hd(cons(X2,X1)) = X2 ) ),
file('/export/starexec/sandbox2/tmp/tmp.WvWGJEKdpo/E---3.1_7659.p',ax23) ).
fof(ax4,axiom,
! [X1] :
( ssList(X1)
=> ( singletonP(X1)
<=> ? [X2] :
( ssItem(X2)
& cons(X2,nil) = X1 ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.WvWGJEKdpo/E---3.1_7659.p',ax4) ).
fof(ax17,axiom,
ssList(nil),
file('/export/starexec/sandbox2/tmp/tmp.WvWGJEKdpo/E---3.1_7659.p',ax17) ).
fof(ax16,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> ssList(cons(X2,X1)) ) ),
file('/export/starexec/sandbox2/tmp/tmp.WvWGJEKdpo/E---3.1_7659.p',ax16) ).
fof(co1,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ~ neq(X2,nil)
| ? [X5] :
( ssItem(X5)
& ? [X6] :
( ssItem(X6)
& ? [X7] :
( ssList(X7)
& app(app(cons(X5,nil),cons(X6,nil)),X7) = X4 ) ) )
| singletonP(X2) ) ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.WvWGJEKdpo/E---3.1_7659.p',co1) ).
fof(ax81,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> cons(X2,X1) = app(cons(X2,nil),X1) ) ),
file('/export/starexec/sandbox2/tmp/tmp.WvWGJEKdpo/E---3.1_7659.p',ax81) ).
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/sandbox2/tmp/tmp.WvWGJEKdpo/E---3.1_7659.p',ax27) ).
fof(ax20,axiom,
! [X1] :
( ssList(X1)
=> ( nil = X1
| ? [X2] :
( ssList(X2)
& ? [X3] :
( ssItem(X3)
& cons(X3,X2) = X1 ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.WvWGJEKdpo/E---3.1_7659.p',ax20) ).
fof(ax15,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( neq(X1,X2)
<=> X1 != X2 ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.WvWGJEKdpo/E---3.1_7659.p',ax15) ).
fof(c_0_9,plain,
! [X126,X127] :
( ~ ssList(X126)
| ~ ssItem(X127)
| hd(cons(X127,X126)) = X127 ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax23])])]) ).
fof(c_0_10,plain,
! [X18,X20] :
( ( ssItem(esk5_1(X18))
| ~ singletonP(X18)
| ~ ssList(X18) )
& ( cons(esk5_1(X18),nil) = X18
| ~ singletonP(X18)
| ~ ssList(X18) )
& ( ~ ssItem(X20)
| cons(X20,nil) != X18
| singletonP(X18)
| ~ ssList(X18) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax4])])])])]) ).
cnf(c_0_11,plain,
( hd(cons(X2,X1)) = X2
| ~ ssList(X1)
| ~ ssItem(X2) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_12,plain,
( cons(esk5_1(X1),nil) = X1
| ~ singletonP(X1)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_13,plain,
ssList(nil),
inference(split_conjunct,[status(thm)],[ax17]) ).
cnf(c_0_14,plain,
( ssItem(esk5_1(X1))
| ~ singletonP(X1)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_15,plain,
( singletonP(X2)
| ~ ssItem(X1)
| cons(X1,nil) != X2
| ~ ssList(X2) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
fof(c_0_16,plain,
! [X112,X113] :
( ~ ssList(X112)
| ~ ssItem(X113)
| ssList(cons(X113,X112)) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax16])])]) ).
cnf(c_0_17,plain,
( esk5_1(X1) = hd(X1)
| ~ singletonP(X1)
| ~ ssList(X1) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_12]),c_0_13])]),c_0_14]) ).
cnf(c_0_18,plain,
( singletonP(cons(X1,nil))
| ~ ssList(cons(X1,nil))
| ~ ssItem(X1) ),
inference(er,[status(thm)],[c_0_15]) ).
cnf(c_0_19,plain,
( ssList(cons(X2,X1))
| ~ ssList(X1)
| ~ ssItem(X2) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
fof(c_0_20,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ~ neq(X2,nil)
| ? [X5] :
( ssItem(X5)
& ? [X6] :
( ssItem(X6)
& ? [X7] :
( ssList(X7)
& app(app(cons(X5,nil),cons(X6,nil)),X7) = X4 ) ) )
| singletonP(X2) ) ) ) ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[co1])]) ).
cnf(c_0_21,plain,
( cons(hd(X1),nil) = X1
| ~ singletonP(X1)
| ~ ssList(X1) ),
inference(spm,[status(thm)],[c_0_12,c_0_17]) ).
cnf(c_0_22,plain,
( singletonP(cons(X1,nil))
| ~ ssItem(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_13])]) ).
cnf(c_0_23,plain,
( ssItem(hd(X1))
| ~ singletonP(X1)
| ~ ssList(X1) ),
inference(spm,[status(thm)],[c_0_14,c_0_17]) ).
fof(c_0_24,negated_conjecture,
! [X256,X257,X258] :
( ssList(esk48_0)
& ssList(esk49_0)
& ssList(esk50_0)
& ssList(esk51_0)
& esk49_0 = esk51_0
& esk48_0 = esk50_0
& neq(esk49_0,nil)
& ( ~ ssItem(X256)
| ~ ssItem(X257)
| ~ ssList(X258)
| app(app(cons(X256,nil),cons(X257,nil)),X258) != esk51_0 )
& ~ singletonP(esk49_0) ),
inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_20])])])]) ).
cnf(c_0_25,plain,
( cons(hd(cons(X1,nil)),nil) = cons(X1,nil)
| ~ ssList(cons(X1,nil))
| ~ ssItem(X1) ),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_26,plain,
( ssItem(hd(cons(X1,nil)))
| ~ ssList(cons(X1,nil))
| ~ ssItem(X1) ),
inference(spm,[status(thm)],[c_0_23,c_0_22]) ).
cnf(c_0_27,negated_conjecture,
( ~ ssItem(X1)
| ~ ssItem(X2)
| ~ ssList(X3)
| app(app(cons(X1,nil),cons(X2,nil)),X3) != esk51_0 ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_28,negated_conjecture,
esk49_0 = esk51_0,
inference(split_conjunct,[status(thm)],[c_0_24]) ).
fof(c_0_29,plain,
! [X221,X222] :
( ~ ssList(X221)
| ~ ssItem(X222)
| cons(X222,X221) = app(cons(X222,nil),X221) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax81])])]) ).
cnf(c_0_30,plain,
( cons(hd(cons(X1,nil)),nil) = cons(X1,nil)
| ~ ssItem(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_19]),c_0_13])]) ).
cnf(c_0_31,plain,
( ssItem(hd(cons(X1,nil)))
| ~ ssItem(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_19]),c_0_13])]) ).
cnf(c_0_32,negated_conjecture,
( app(app(cons(X1,nil),cons(X2,nil)),X3) != esk49_0
| ~ ssList(X3)
| ~ ssItem(X2)
| ~ ssItem(X1) ),
inference(rw,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_33,plain,
( cons(X2,X1) = app(cons(X2,nil),X1)
| ~ ssList(X1)
| ~ ssItem(X2) ),
inference(split_conjunct,[status(thm)],[c_0_29]) ).
cnf(c_0_34,plain,
( ssList(cons(X1,nil))
| ~ ssItem(X1) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_30]),c_0_13])]),c_0_31]) ).
fof(c_0_35,plain,
! [X133,X134,X135] :
( ~ ssList(X133)
| ~ ssList(X134)
| ~ ssItem(X135)
| cons(X135,app(X134,X133)) = app(cons(X135,X134),X133) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax27])])]) ).
cnf(c_0_36,negated_conjecture,
( app(cons(X1,cons(X2,nil)),X3) != esk49_0
| ~ ssList(X3)
| ~ ssItem(X2)
| ~ ssItem(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_34]) ).
cnf(c_0_37,plain,
( cons(X3,app(X2,X1)) = app(cons(X3,X2),X1)
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssItem(X3) ),
inference(split_conjunct,[status(thm)],[c_0_35]) ).
cnf(c_0_38,negated_conjecture,
( cons(X1,app(cons(X2,nil),X3)) != esk49_0
| ~ ssList(X3)
| ~ ssItem(X2)
| ~ ssItem(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_37]),c_0_34]) ).
fof(c_0_39,plain,
! [X120] :
( ( ssList(esk44_1(X120))
| nil = X120
| ~ ssList(X120) )
& ( ssItem(esk45_1(X120))
| nil = X120
| ~ ssList(X120) )
& ( cons(esk45_1(X120),esk44_1(X120)) = X120
| nil = X120
| ~ ssList(X120) ) ),
inference(distribute,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax20])])])]) ).
cnf(c_0_40,negated_conjecture,
( cons(X1,cons(X2,X3)) != esk49_0
| ~ ssList(X3)
| ~ ssItem(X2)
| ~ ssItem(X1) ),
inference(spm,[status(thm)],[c_0_38,c_0_33]) ).
cnf(c_0_41,plain,
( cons(esk45_1(X1),esk44_1(X1)) = X1
| nil = X1
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_39]) ).
cnf(c_0_42,plain,
( ssItem(esk45_1(X1))
| nil = X1
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_39]) ).
cnf(c_0_43,plain,
( ssList(esk44_1(X1))
| nil = X1
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_39]) ).
cnf(c_0_44,negated_conjecture,
( nil = X1
| cons(X2,X1) != esk49_0
| ~ ssList(X1)
| ~ ssItem(X2) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_41]),c_0_42]),c_0_43]) ).
cnf(c_0_45,negated_conjecture,
ssList(esk49_0),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_46,negated_conjecture,
( esk44_1(esk49_0) = nil
| esk49_0 = nil
| ~ ssList(esk44_1(esk49_0))
| ~ ssItem(esk45_1(esk49_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_41])]),c_0_45])]) ).
cnf(c_0_47,negated_conjecture,
( esk44_1(esk49_0) = nil
| esk49_0 = nil
| ~ ssList(esk44_1(esk49_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_42]),c_0_45])]) ).
cnf(c_0_48,negated_conjecture,
( esk44_1(esk49_0) = nil
| esk49_0 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_43]),c_0_45])]) ).
cnf(c_0_49,negated_conjecture,
( cons(esk45_1(esk49_0),nil) = esk49_0
| esk49_0 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_48]),c_0_45])]) ).
cnf(c_0_50,negated_conjecture,
~ singletonP(esk49_0),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
fof(c_0_51,plain,
! [X110,X111] :
( ( ~ neq(X110,X111)
| X110 != X111
| ~ ssList(X111)
| ~ ssList(X110) )
& ( X110 = X111
| neq(X110,X111)
| ~ ssList(X111)
| ~ ssList(X110) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax15])])])]) ).
cnf(c_0_52,negated_conjecture,
( esk49_0 = nil
| ~ ssItem(esk45_1(esk49_0)) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_49]),c_0_50]) ).
cnf(c_0_53,plain,
( ~ neq(X1,X2)
| X1 != X2
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_51]) ).
cnf(c_0_54,negated_conjecture,
neq(esk49_0,nil),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_55,negated_conjecture,
esk49_0 = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_42]),c_0_45])]) ).
cnf(c_0_56,plain,
( ~ ssList(X1)
| ~ neq(X1,X1) ),
inference(er,[status(thm)],[c_0_53]) ).
cnf(c_0_57,negated_conjecture,
neq(nil,nil),
inference(rw,[status(thm)],[c_0_54,c_0_55]) ).
cnf(c_0_58,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_56,c_0_57]),c_0_13])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SWC149+1 : TPTP v8.1.2. Released v2.4.0.
% 0.12/0.13 % Command : run_E %s %d THM
% 0.13/0.34 % Computer : n016.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 2400
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Tue Oct 3 02:25:07 EDT 2023
% 0.13/0.35 % CPUTime :
% 0.20/0.49 Running first-order model finding
% 0.20/0.49 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.WvWGJEKdpo/E---3.1_7659.p
% 0.71/0.57 # Version: 3.1pre001
% 0.71/0.57 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.71/0.57 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.71/0.57 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.71/0.57 # Starting new_bool_3 with 300s (1) cores
% 0.71/0.57 # Starting new_bool_1 with 300s (1) cores
% 0.71/0.57 # Starting sh5l with 300s (1) cores
% 0.71/0.57 # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 7795 completed with status 0
% 0.71/0.57 # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.71/0.57 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.71/0.57 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.71/0.57 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.71/0.57 # No SInE strategy applied
% 0.71/0.57 # Search class: FGHSF-FSLM21-MFFFFFNN
% 0.71/0.57 # Scheduled 11 strats onto 5 cores with 1500 seconds (1500 total)
% 0.71/0.57 # Starting G-E--_208_C18_SOS_F1_SE_CS_SP_PS_S4c with 136s (1) cores
% 0.71/0.57 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.71/0.57 # Starting G-E--_110_C45_F1_PI_SE_CS_SP_PS_S4S with 136s (1) cores
% 0.71/0.57 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_TT_S0Y with 136s (1) cores
% 0.71/0.57 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2o with 136s (1) cores
% 0.71/0.57 # G-E--_208_C18_F1_SE_CS_SP_PS_S2o with pid 7811 completed with status 0
% 0.71/0.57 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S2o
% 0.71/0.57 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.71/0.57 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.71/0.57 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.71/0.57 # No SInE strategy applied
% 0.71/0.57 # Search class: FGHSF-FSLM21-MFFFFFNN
% 0.71/0.57 # Scheduled 11 strats onto 5 cores with 1500 seconds (1500 total)
% 0.71/0.57 # Starting G-E--_208_C18_SOS_F1_SE_CS_SP_PS_S4c with 136s (1) cores
% 0.71/0.57 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.71/0.57 # Starting G-E--_110_C45_F1_PI_SE_CS_SP_PS_S4S with 136s (1) cores
% 0.71/0.57 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_TT_S0Y with 136s (1) cores
% 0.71/0.57 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2o with 136s (1) cores
% 0.71/0.57 # Preprocessing time : 0.004 s
% 0.71/0.57 # Presaturation interreduction done
% 0.71/0.57
% 0.71/0.57 # Proof found!
% 0.71/0.57 # SZS status Theorem
% 0.71/0.57 # SZS output start CNFRefutation
% See solution above
% 0.71/0.57 # Parsed axioms : 96
% 0.71/0.57 # Removed by relevancy pruning/SinE : 0
% 0.71/0.57 # Initial clauses : 199
% 0.71/0.57 # Removed in clause preprocessing : 2
% 0.71/0.57 # Initial clauses in saturation : 197
% 0.71/0.57 # Processed clauses : 593
% 0.71/0.57 # ...of these trivial : 2
% 0.71/0.57 # ...subsumed : 131
% 0.71/0.57 # ...remaining for further processing : 460
% 0.71/0.57 # Other redundant clauses eliminated : 73
% 0.71/0.57 # Clauses deleted for lack of memory : 0
% 0.71/0.57 # Backward-subsumed : 10
% 0.71/0.57 # Backward-rewritten : 25
% 0.71/0.57 # Generated clauses : 813
% 0.71/0.57 # ...of the previous two non-redundant : 679
% 0.71/0.57 # ...aggressively subsumed : 0
% 0.71/0.57 # Contextual simplify-reflections : 28
% 0.71/0.57 # Paramodulations : 737
% 0.71/0.57 # Factorizations : 0
% 0.71/0.57 # NegExts : 0
% 0.71/0.57 # Equation resolutions : 78
% 0.71/0.57 # Total rewrite steps : 363
% 0.71/0.57 # Propositional unsat checks : 0
% 0.71/0.57 # Propositional check models : 0
% 0.71/0.57 # Propositional check unsatisfiable : 0
% 0.71/0.57 # Propositional clauses : 0
% 0.71/0.57 # Propositional clauses after purity: 0
% 0.71/0.57 # Propositional unsat core size : 0
% 0.71/0.57 # Propositional preprocessing time : 0.000
% 0.71/0.57 # Propositional encoding time : 0.000
% 0.71/0.57 # Propositional solver time : 0.000
% 0.71/0.57 # Success case prop preproc time : 0.000
% 0.71/0.57 # Success case prop encoding time : 0.000
% 0.71/0.57 # Success case prop solver time : 0.000
% 0.71/0.57 # Current number of processed clauses : 211
% 0.71/0.57 # Positive orientable unit clauses : 21
% 0.71/0.57 # Positive unorientable unit clauses: 0
% 0.71/0.57 # Negative unit clauses : 2
% 0.71/0.57 # Non-unit-clauses : 188
% 0.71/0.58 # Current number of unprocessed clauses: 468
% 0.71/0.58 # ...number of literals in the above : 2907
% 0.71/0.58 # Current number of archived formulas : 0
% 0.71/0.58 # Current number of archived clauses : 226
% 0.71/0.58 # Clause-clause subsumption calls (NU) : 20645
% 0.71/0.58 # Rec. Clause-clause subsumption calls : 5457
% 0.71/0.58 # Non-unit clause-clause subsumptions : 150
% 0.71/0.58 # Unit Clause-clause subsumption calls : 85
% 0.71/0.58 # Rewrite failures with RHS unbound : 0
% 0.71/0.58 # BW rewrite match attempts : 3
% 0.71/0.58 # BW rewrite match successes : 3
% 0.71/0.58 # Condensation attempts : 0
% 0.71/0.58 # Condensation successes : 0
% 0.71/0.58 # Termbank termtop insertions : 29573
% 0.71/0.58
% 0.71/0.58 # -------------------------------------------------
% 0.71/0.58 # User time : 0.062 s
% 0.71/0.58 # System time : 0.005 s
% 0.71/0.58 # Total time : 0.067 s
% 0.71/0.58 # Maximum resident set size: 2476 pages
% 0.71/0.58
% 0.71/0.58 # -------------------------------------------------
% 0.71/0.58 # User time : 0.275 s
% 0.71/0.58 # System time : 0.020 s
% 0.71/0.58 # Total time : 0.294 s
% 0.71/0.58 # Maximum resident set size: 1796 pages
% 0.71/0.58 % E---3.1 exiting
%------------------------------------------------------------------------------