TSTP Solution File: SWC397+1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : SWC397+1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n027.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:40:49 EDT 2023
% Result : Theorem 0.21s 0.53s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 9
% Syntax : Number of formulae : 59 ( 20 unt; 0 def)
% Number of atoms : 235 ( 48 equ)
% Maximal formula atoms : 19 ( 3 avg)
% Number of connectives : 292 ( 116 ~; 115 |; 27 &)
% ( 4 <=>; 30 =>; 0 <=; 0 <~>)
% Maximal formula depth : 21 ( 5 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 12 ( 12 usr; 8 con; 0-2 aty)
% Number of variables : 73 ( 0 sgn; 47 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(co1,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ! [X5] :
( ssItem(X5)
=> ( ~ memberP(X1,X5)
| memberP(X2,X5) ) )
| ( nil != X3
& nil = X4 )
| ( ! [X6] :
( ssItem(X6)
=> ! [X7] :
( ssList(X7)
=> ( app(cons(X6,nil),X7) != X3
| app(X7,cons(X6,nil)) != X4 ) ) )
& neq(X4,nil) ) ) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.044SanDdIT/E---3.1_21135.p',co1) ).
fof(ax38,axiom,
! [X1] :
( ssItem(X1)
=> ~ memberP(nil,X1) ),
file('/export/starexec/sandbox/tmp/tmp.044SanDdIT/E---3.1_21135.p',ax38) ).
fof(ax15,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( neq(X1,X2)
<=> X1 != X2 ) ) ),
file('/export/starexec/sandbox/tmp/tmp.044SanDdIT/E---3.1_21135.p',ax15) ).
fof(ax17,axiom,
ssList(nil),
file('/export/starexec/sandbox/tmp/tmp.044SanDdIT/E---3.1_21135.p',ax17) ).
fof(ax81,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> cons(X2,X1) = app(cons(X2,nil),X1) ) ),
file('/export/starexec/sandbox/tmp/tmp.044SanDdIT/E---3.1_21135.p',ax81) ).
fof(ax3,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> ( memberP(X1,X2)
<=> ? [X3] :
( ssList(X3)
& ? [X4] :
( ssList(X4)
& app(X3,cons(X2,X4)) = X1 ) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.044SanDdIT/E---3.1_21135.p',ax3) ).
fof(ax36,axiom,
! [X1] :
( ssItem(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( memberP(app(X2,X3),X1)
<=> ( memberP(X2,X1)
| memberP(X3,X1) ) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.044SanDdIT/E---3.1_21135.p',ax36) ).
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.044SanDdIT/E---3.1_21135.p',ax37) ).
fof(ax16,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> ssList(cons(X2,X1)) ) ),
file('/export/starexec/sandbox/tmp/tmp.044SanDdIT/E---3.1_21135.p',ax16) ).
fof(c_0_9,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ! [X5] :
( ssItem(X5)
=> ( ~ memberP(X1,X5)
| memberP(X2,X5) ) )
| ( nil != X3
& nil = X4 )
| ( ! [X6] :
( ssItem(X6)
=> ! [X7] :
( ssList(X7)
=> ( app(cons(X6,nil),X7) != X3
| app(X7,cons(X6,nil)) != X4 ) ) )
& neq(X4,nil) ) ) ) ) ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[co1])]) ).
fof(c_0_10,negated_conjecture,
( ssList(esk1_0)
& ssList(esk2_0)
& ssList(esk3_0)
& ssList(esk4_0)
& esk2_0 = esk4_0
& esk1_0 = esk3_0
& ssItem(esk5_0)
& memberP(esk1_0,esk5_0)
& ~ memberP(esk2_0,esk5_0)
& ( nil = esk3_0
| nil != esk4_0 )
& ( ssItem(esk6_0)
| ~ neq(esk4_0,nil) )
& ( ssList(esk7_0)
| ~ neq(esk4_0,nil) )
& ( app(cons(esk6_0,nil),esk7_0) = esk3_0
| ~ neq(esk4_0,nil) )
& ( app(esk7_0,cons(esk6_0,nil)) = esk4_0
| ~ neq(esk4_0,nil) ) ),
inference(distribute,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_9])])])]) ).
fof(c_0_11,plain,
! [X1] :
( ssItem(X1)
=> ~ memberP(nil,X1) ),
inference(fof_simplification,[status(thm)],[ax38]) ).
cnf(c_0_12,negated_conjecture,
memberP(esk1_0,esk5_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_13,negated_conjecture,
esk1_0 = esk3_0,
inference(split_conjunct,[status(thm)],[c_0_10]) ).
fof(c_0_14,plain,
! [X17,X18] :
( ( ~ neq(X17,X18)
| X17 != X18
| ~ ssList(X18)
| ~ ssList(X17) )
& ( X17 = X18
| neq(X17,X18)
| ~ ssList(X18)
| ~ ssList(X17) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax15])])])]) ).
fof(c_0_15,plain,
! [X66] :
( ~ ssItem(X66)
| ~ memberP(nil,X66) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_11])]) ).
cnf(c_0_16,negated_conjecture,
memberP(esk3_0,esk5_0),
inference(rw,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_17,negated_conjecture,
( nil = esk3_0
| nil != esk4_0 ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_18,plain,
( X1 = X2
| neq(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_19,plain,
ssList(nil),
inference(split_conjunct,[status(thm)],[ax17]) ).
cnf(c_0_20,negated_conjecture,
ssList(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_21,negated_conjecture,
esk2_0 = esk4_0,
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_22,plain,
( ~ ssItem(X1)
| ~ memberP(nil,X1) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_23,negated_conjecture,
( memberP(nil,esk5_0)
| esk4_0 != nil ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_24,negated_conjecture,
ssItem(esk5_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
fof(c_0_25,plain,
! [X36,X37] :
( ~ ssList(X36)
| ~ ssItem(X37)
| cons(X37,X36) = app(cons(X37,nil),X36) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax81])])]) ).
cnf(c_0_26,plain,
( X1 = nil
| neq(X1,nil)
| ~ ssList(X1) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_27,negated_conjecture,
ssList(esk4_0),
inference(rw,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_28,negated_conjecture,
esk4_0 != nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_24])]) ).
cnf(c_0_29,negated_conjecture,
( app(cons(esk6_0,nil),esk7_0) = esk3_0
| ~ neq(esk4_0,nil) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_30,plain,
( cons(X2,X1) = app(cons(X2,nil),X1)
| ~ ssList(X1)
| ~ ssItem(X2) ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_31,negated_conjecture,
( ssItem(esk6_0)
| ~ neq(esk4_0,nil) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_32,negated_conjecture,
( ssList(esk7_0)
| ~ neq(esk4_0,nil) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
fof(c_0_33,plain,
! [X54,X55,X58,X59] :
( ( ssList(esk12_2(X54,X55))
| ~ memberP(X54,X55)
| ~ ssItem(X55)
| ~ ssList(X54) )
& ( ssList(esk13_2(X54,X55))
| ~ memberP(X54,X55)
| ~ ssItem(X55)
| ~ ssList(X54) )
& ( app(esk12_2(X54,X55),cons(X55,esk13_2(X54,X55))) = X54
| ~ memberP(X54,X55)
| ~ ssItem(X55)
| ~ ssList(X54) )
& ( ~ ssList(X58)
| ~ ssList(X59)
| app(X58,cons(X55,X59)) != X54
| memberP(X54,X55)
| ~ ssItem(X55)
| ~ ssList(X54) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax3])])])])]) ).
fof(c_0_34,plain,
! [X60,X61,X62] :
( ( ~ memberP(app(X61,X62),X60)
| memberP(X61,X60)
| memberP(X62,X60)
| ~ ssList(X62)
| ~ ssList(X61)
| ~ ssItem(X60) )
& ( ~ memberP(X61,X60)
| memberP(app(X61,X62),X60)
| ~ ssList(X62)
| ~ ssList(X61)
| ~ ssItem(X60) )
& ( ~ memberP(X62,X60)
| memberP(app(X61,X62),X60)
| ~ ssList(X62)
| ~ ssList(X61)
| ~ ssItem(X60) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax36])])])]) ).
cnf(c_0_35,negated_conjecture,
( app(esk7_0,cons(esk6_0,nil)) = esk4_0
| ~ neq(esk4_0,nil) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_36,negated_conjecture,
neq(esk4_0,nil),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_28]) ).
fof(c_0_37,plain,
! [X63,X64,X65] :
( ( ~ memberP(cons(X64,X65),X63)
| X63 = X64
| memberP(X65,X63)
| ~ ssList(X65)
| ~ ssItem(X64)
| ~ ssItem(X63) )
& ( X63 != X64
| memberP(cons(X64,X65),X63)
| ~ ssList(X65)
| ~ ssItem(X64)
| ~ ssItem(X63) )
& ( ~ memberP(X65,X63)
| memberP(cons(X64,X65),X63)
| ~ ssList(X65)
| ~ ssItem(X64)
| ~ ssItem(X63) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax37])])])]) ).
cnf(c_0_38,negated_conjecture,
( cons(esk6_0,esk7_0) = esk3_0
| ~ neq(esk4_0,nil) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_31]),c_0_32]) ).
cnf(c_0_39,plain,
( memberP(X4,X3)
| ~ ssList(X1)
| ~ ssList(X2)
| app(X1,cons(X3,X2)) != X4
| ~ ssItem(X3)
| ~ ssList(X4) ),
inference(split_conjunct,[status(thm)],[c_0_33]) ).
cnf(c_0_40,plain,
( memberP(app(X1,X3),X2)
| ~ memberP(X1,X2)
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssItem(X2) ),
inference(split_conjunct,[status(thm)],[c_0_34]) ).
cnf(c_0_41,negated_conjecture,
app(esk7_0,cons(esk6_0,nil)) = esk4_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_35,c_0_36])]) ).
cnf(c_0_42,negated_conjecture,
ssList(esk7_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_32,c_0_36])]) ).
fof(c_0_43,plain,
! [X44,X45] :
( ~ ssList(X44)
| ~ ssItem(X45)
| ssList(cons(X45,X44)) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax16])])]) ).
cnf(c_0_44,plain,
( X3 = X1
| memberP(X2,X3)
| ~ memberP(cons(X1,X2),X3)
| ~ ssList(X2)
| ~ ssItem(X1)
| ~ ssItem(X3) ),
inference(split_conjunct,[status(thm)],[c_0_37]) ).
cnf(c_0_45,negated_conjecture,
cons(esk6_0,esk7_0) = esk3_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_38,c_0_36])]) ).
cnf(c_0_46,negated_conjecture,
ssItem(esk6_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_31,c_0_36])]) ).
cnf(c_0_47,plain,
( memberP(app(X1,cons(X2,X3)),X2)
| ~ ssList(app(X1,cons(X2,X3)))
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssItem(X2) ),
inference(er,[status(thm)],[c_0_39]) ).
cnf(c_0_48,negated_conjecture,
( memberP(esk4_0,X1)
| ~ memberP(esk7_0,X1)
| ~ ssList(cons(esk6_0,nil))
| ~ ssItem(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_41]),c_0_42])]) ).
cnf(c_0_49,plain,
( ssList(cons(X2,X1))
| ~ ssList(X1)
| ~ ssItem(X2) ),
inference(split_conjunct,[status(thm)],[c_0_43]) ).
cnf(c_0_50,negated_conjecture,
( esk6_0 = X1
| memberP(esk7_0,X1)
| ~ memberP(esk3_0,X1)
| ~ ssItem(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_45]),c_0_42]),c_0_46])]) ).
cnf(c_0_51,negated_conjecture,
~ memberP(esk2_0,esk5_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_52,negated_conjecture,
( memberP(esk4_0,esk6_0)
| ~ neq(esk4_0,nil) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_35]),c_0_27]),c_0_19])]),c_0_31]),c_0_32]) ).
cnf(c_0_53,negated_conjecture,
( memberP(esk4_0,X1)
| ~ memberP(esk7_0,X1)
| ~ ssItem(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_49]),c_0_19]),c_0_46])]) ).
cnf(c_0_54,negated_conjecture,
( esk6_0 = esk5_0
| memberP(esk7_0,esk5_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_16]),c_0_24])]) ).
cnf(c_0_55,negated_conjecture,
~ memberP(esk4_0,esk5_0),
inference(rw,[status(thm)],[c_0_51,c_0_21]) ).
cnf(c_0_56,negated_conjecture,
memberP(esk4_0,esk6_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_52,c_0_36])]) ).
cnf(c_0_57,negated_conjecture,
esk6_0 = esk5_0,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_54]),c_0_24])]),c_0_55]) ).
cnf(c_0_58,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_56,c_0_57]),c_0_55]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.13 % Problem : SWC397+1 : TPTP v8.1.2. Released v2.4.0.
% 0.11/0.15 % Command : run_E %s %d THM
% 0.14/0.36 % Computer : n027.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 2400
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Tue Oct 3 02:15:16 EDT 2023
% 0.14/0.36 % CPUTime :
% 0.21/0.49 Running first-order theorem proving
% 0.21/0.49 Running: /export/starexec/sandbox/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/tmp/tmp.044SanDdIT/E---3.1_21135.p
% 0.21/0.53 # Version: 3.1pre001
% 0.21/0.53 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.21/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.53 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.21/0.53 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.53 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.53 # Starting sh5l with 300s (1) cores
% 0.21/0.53 # new_bool_3 with pid 21246 completed with status 0
% 0.21/0.53 # Result found by new_bool_3
% 0.21/0.53 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.21/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.53 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.21/0.53 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.53 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.21/0.53 # Search class: FGHSF-FFMM21-MFFFFFNN
% 0.21/0.53 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.53 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 0.21/0.53 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 21251 completed with status 0
% 0.21/0.53 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.21/0.53 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.21/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.53 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.21/0.53 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.53 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.21/0.53 # Search class: FGHSF-FFMM21-MFFFFFNN
% 0.21/0.53 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.53 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 0.21/0.53 # Preprocessing time : 0.002 s
% 0.21/0.53 # Presaturation interreduction done
% 0.21/0.53
% 0.21/0.53 # Proof found!
% 0.21/0.53 # SZS status Theorem
% 0.21/0.53 # SZS output start CNFRefutation
% See solution above
% 0.21/0.53 # Parsed axioms : 96
% 0.21/0.53 # Removed by relevancy pruning/SinE : 73
% 0.21/0.53 # Initial clauses : 52
% 0.21/0.53 # Removed in clause preprocessing : 0
% 0.21/0.53 # Initial clauses in saturation : 52
% 0.21/0.53 # Processed clauses : 295
% 0.21/0.53 # ...of these trivial : 5
% 0.21/0.53 # ...subsumed : 54
% 0.21/0.53 # ...remaining for further processing : 236
% 0.21/0.53 # Other redundant clauses eliminated : 12
% 0.21/0.53 # Clauses deleted for lack of memory : 0
% 0.21/0.53 # Backward-subsumed : 17
% 0.21/0.53 # Backward-rewritten : 37
% 0.21/0.53 # Generated clauses : 592
% 0.21/0.53 # ...of the previous two non-redundant : 543
% 0.21/0.53 # ...aggressively subsumed : 0
% 0.21/0.53 # Contextual simplify-reflections : 8
% 0.21/0.53 # Paramodulations : 569
% 0.21/0.53 # Factorizations : 0
% 0.21/0.53 # NegExts : 0
% 0.21/0.53 # Equation resolutions : 16
% 0.21/0.53 # Total rewrite steps : 437
% 0.21/0.53 # Propositional unsat checks : 0
% 0.21/0.53 # Propositional check models : 0
% 0.21/0.53 # Propositional check unsatisfiable : 0
% 0.21/0.53 # Propositional clauses : 0
% 0.21/0.53 # Propositional clauses after purity: 0
% 0.21/0.53 # Propositional unsat core size : 0
% 0.21/0.53 # Propositional preprocessing time : 0.000
% 0.21/0.53 # Propositional encoding time : 0.000
% 0.21/0.53 # Propositional solver time : 0.000
% 0.21/0.53 # Success case prop preproc time : 0.000
% 0.21/0.53 # Success case prop encoding time : 0.000
% 0.21/0.53 # Success case prop solver time : 0.000
% 0.21/0.53 # Current number of processed clauses : 119
% 0.21/0.53 # Positive orientable unit clauses : 33
% 0.21/0.53 # Positive unorientable unit clauses: 0
% 0.21/0.53 # Negative unit clauses : 8
% 0.21/0.53 # Non-unit-clauses : 78
% 0.21/0.53 # Current number of unprocessed clauses: 310
% 0.21/0.53 # ...number of literals in the above : 1399
% 0.21/0.53 # Current number of archived formulas : 0
% 0.21/0.53 # Current number of archived clauses : 112
% 0.21/0.53 # Clause-clause subsumption calls (NU) : 3468
% 0.21/0.53 # Rec. Clause-clause subsumption calls : 1772
% 0.21/0.53 # Non-unit clause-clause subsumptions : 48
% 0.21/0.53 # Unit Clause-clause subsumption calls : 892
% 0.21/0.53 # Rewrite failures with RHS unbound : 0
% 0.21/0.53 # BW rewrite match attempts : 5
% 0.21/0.53 # BW rewrite match successes : 5
% 0.21/0.53 # Condensation attempts : 0
% 0.21/0.53 # Condensation successes : 0
% 0.21/0.53 # Termbank termtop insertions : 12756
% 0.21/0.53
% 0.21/0.53 # -------------------------------------------------
% 0.21/0.53 # User time : 0.024 s
% 0.21/0.53 # System time : 0.005 s
% 0.21/0.53 # Total time : 0.029 s
% 0.21/0.53 # Maximum resident set size: 1916 pages
% 0.21/0.53
% 0.21/0.53 # -------------------------------------------------
% 0.21/0.53 # User time : 0.026 s
% 0.21/0.53 # System time : 0.007 s
% 0.21/0.53 # Total time : 0.033 s
% 0.21/0.53 # Maximum resident set size: 1800 pages
% 0.21/0.53 % E---3.1 exiting
% 0.21/0.54 % E---3.1 exiting
%------------------------------------------------------------------------------