TSTP Solution File: SWC311+1 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : SWC311+1 : TPTP v8.2.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n013.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 : Tue May 21 04:28:59 EDT 2024
% Result : Theorem 0.19s 0.50s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 9
% Syntax : Number of formulae : 56 ( 9 unt; 0 def)
% Number of atoms : 258 ( 108 equ)
% Maximal formula atoms : 34 ( 4 avg)
% Number of connectives : 326 ( 124 ~; 126 |; 44 &)
% ( 2 <=>; 30 =>; 0 <=; 0 <~>)
% Maximal formula depth : 29 ( 6 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 5 con; 0-2 aty)
% Number of variables : 77 ( 0 sgn 41 !; 12 ?)
% Comments :
%------------------------------------------------------------------------------
fof(co1,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ( nil != X3
& nil = X4 )
| ( ? [X5] :
( ssList(X5)
& X3 != X5
& ? [X6] :
( ssList(X6)
& ? [X7] :
( ssList(X7)
& tl(X4) = X6
& app(X6,X7) = X5
& ? [X8] :
( ssItem(X8)
& cons(X8,nil) = X7
& hd(X4) = X8
& neq(nil,X4) )
& neq(nil,X4) ) ) )
& neq(X4,nil) )
| ( ( nil != X2
| nil = X1 )
& ( ~ neq(X2,nil)
| ? [X9] :
( ssItem(X9)
& ? [X10] :
( ssList(X10)
& app(cons(X9,nil),X10) = X2
& app(X10,cons(X9,nil)) = X1 ) ) ) ) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).
fof(ax26,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ssList(app(X1,X2)) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax26) ).
fof(ax15,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( neq(X1,X2)
<=> X1 != X2 ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax15) ).
fof(ax22,axiom,
! [X1] :
( ssList(X1)
=> ( nil != X1
=> ssItem(hd(X1)) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax22) ).
fof(ax17,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax17) ).
fof(ax24,axiom,
! [X1] :
( ssList(X1)
=> ( nil != X1
=> ssList(tl(X1)) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax24) ).
fof(ax16,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> ssList(cons(X2,X1)) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax16) ).
fof(ax81,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> cons(X2,X1) = app(cons(X2,nil),X1) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax81) ).
fof(ax78,axiom,
! [X1] :
( ssList(X1)
=> ( nil != X1
=> cons(hd(X1),tl(X1)) = X1 ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax78) ).
fof(c_0_9,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ( nil != X3
& nil = X4 )
| ( ? [X5] :
( ssList(X5)
& X3 != X5
& ? [X6] :
( ssList(X6)
& ? [X7] :
( ssList(X7)
& tl(X4) = X6
& app(X6,X7) = X5
& ? [X8] :
( ssItem(X8)
& cons(X8,nil) = X7
& hd(X4) = X8
& neq(nil,X4) )
& neq(nil,X4) ) ) )
& neq(X4,nil) )
| ( ( nil != X2
| nil = X1 )
& ( ~ neq(X2,nil)
| ? [X9] :
( ssItem(X9)
& ? [X10] :
( ssList(X10)
& app(cons(X9,nil),X10) = X2
& app(X10,cons(X9,nil)) = X1 ) ) ) ) ) ) ) ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[co1])]) ).
fof(c_0_10,negated_conjecture,
! [X15,X16,X17,X18,X19,X20] :
( ssList(esk1_0)
& ssList(esk2_0)
& ssList(esk3_0)
& ssList(esk4_0)
& esk2_0 = esk4_0
& esk1_0 = esk3_0
& ( nil = esk3_0
| nil != esk4_0 )
& ( ~ ssList(X15)
| esk3_0 = X15
| ~ ssList(X16)
| ~ ssList(X17)
| tl(esk4_0) != X16
| app(X16,X17) != X15
| ~ ssItem(X18)
| cons(X18,nil) != X17
| hd(esk4_0) != X18
| ~ neq(nil,esk4_0)
| ~ neq(nil,esk4_0)
| ~ neq(esk4_0,nil) )
& ( neq(esk2_0,nil)
| nil = esk2_0 )
& ( ~ ssItem(X19)
| ~ ssList(X20)
| app(cons(X19,nil),X20) != esk2_0
| app(X20,cons(X19,nil)) != esk1_0
| nil = esk2_0 )
& ( neq(esk2_0,nil)
| nil != esk1_0 )
& ( ~ ssItem(X19)
| ~ ssList(X20)
| app(cons(X19,nil),X20) != esk2_0
| app(X20,cons(X19,nil)) != esk1_0
| nil != esk1_0 ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_9])])])])])]) ).
cnf(c_0_11,negated_conjecture,
( esk3_0 = X1
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3)
| tl(esk4_0) != X2
| app(X2,X3) != X1
| ~ ssItem(X4)
| cons(X4,nil) != X3
| hd(esk4_0) != X4
| ~ neq(nil,esk4_0)
| ~ neq(nil,esk4_0)
| ~ neq(esk4_0,nil) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
fof(c_0_12,plain,
! [X21,X22] :
( ~ ssList(X21)
| ~ ssList(X22)
| ssList(app(X21,X22)) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax26])])])]) ).
fof(c_0_13,plain,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( neq(X1,X2)
<=> X1 != X2 ) ) ),
inference(fof_simplification,[status(thm)],[ax15]) ).
cnf(c_0_14,negated_conjecture,
( esk3_0 = X1
| hd(esk4_0) != X4
| tl(esk4_0) != X2
| app(X2,X3) != X1
| cons(X4,nil) != X3
| ~ ssItem(X4)
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1)
| ~ neq(nil,esk4_0)
| ~ neq(esk4_0,nil) ),
inference(cn,[status(thm)],[c_0_11]) ).
cnf(c_0_15,negated_conjecture,
esk1_0 = esk3_0,
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_16,negated_conjecture,
esk2_0 = esk4_0,
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_17,plain,
( ssList(app(X1,X2))
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
fof(c_0_18,plain,
! [X58,X59] :
( ( ~ neq(X58,X59)
| X58 != X59
| ~ ssList(X59)
| ~ ssList(X58) )
& ( X58 = X59
| neq(X58,X59)
| ~ ssList(X59)
| ~ ssList(X58) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_13])])])])]) ).
fof(c_0_19,plain,
! [X1] :
( ssList(X1)
=> ( nil != X1
=> ssItem(hd(X1)) ) ),
inference(fof_simplification,[status(thm)],[ax22]) ).
cnf(c_0_20,negated_conjecture,
( app(tl(esk2_0),cons(hd(esk2_0),nil)) = esk1_0
| ~ ssList(cons(hd(esk2_0),nil))
| ~ ssList(tl(esk2_0))
| ~ neq(nil,esk2_0)
| ~ neq(esk2_0,nil)
| ~ ssItem(hd(esk2_0)) ),
inference(csr,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_14,c_0_15]),c_0_16]),c_0_16]),c_0_16]),c_0_16])])])])]),c_0_17]) ).
cnf(c_0_21,plain,
( X1 = X2
| neq(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_22,negated_conjecture,
ssList(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_23,plain,
ssList(nil),
inference(split_conjunct,[status(thm)],[ax17]) ).
cnf(c_0_24,negated_conjecture,
( neq(esk2_0,nil)
| nil = esk2_0 ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
fof(c_0_25,plain,
! [X60] :
( ~ ssList(X60)
| nil = X60
| ssItem(hd(X60)) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_19])])]) ).
fof(c_0_26,plain,
! [X1] :
( ssList(X1)
=> ( nil != X1
=> ssList(tl(X1)) ) ),
inference(fof_simplification,[status(thm)],[ax24]) ).
cnf(c_0_27,negated_conjecture,
( app(tl(esk2_0),cons(hd(esk2_0),nil)) = esk1_0
| esk2_0 = nil
| ~ ssList(cons(hd(esk2_0),nil))
| ~ ssList(tl(esk2_0))
| ~ ssItem(hd(esk2_0)) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_22]),c_0_23])]),c_0_24]) ).
cnf(c_0_28,plain,
( nil = X1
| ssItem(hd(X1))
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
fof(c_0_29,plain,
! [X70] :
( ~ ssList(X70)
| nil = X70
| ssList(tl(X70)) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_26])])]) ).
cnf(c_0_30,negated_conjecture,
( app(tl(esk2_0),cons(hd(esk2_0),nil)) = esk1_0
| esk2_0 = nil
| ~ ssList(cons(hd(esk2_0),nil))
| ~ ssList(tl(esk2_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_22])]) ).
cnf(c_0_31,plain,
( nil = X1
| ssList(tl(X1))
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_29]) ).
fof(c_0_32,plain,
! [X41,X42] :
( ~ ssList(X41)
| ~ ssItem(X42)
| ssList(cons(X42,X41)) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax16])])])]) ).
cnf(c_0_33,negated_conjecture,
( app(tl(esk2_0),cons(hd(esk2_0),nil)) = esk1_0
| esk2_0 = nil
| ~ ssList(cons(hd(esk2_0),nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_22])]) ).
cnf(c_0_34,plain,
( ssList(cons(X2,X1))
| ~ ssList(X1)
| ~ ssItem(X2) ),
inference(split_conjunct,[status(thm)],[c_0_32]) ).
cnf(c_0_35,negated_conjecture,
( app(tl(esk2_0),cons(hd(esk2_0),nil)) = esk1_0
| esk2_0 = nil
| ~ ssItem(hd(esk2_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_23])]) ).
cnf(c_0_36,negated_conjecture,
( nil = esk2_0
| ~ ssItem(X1)
| ~ ssList(X2)
| app(cons(X1,nil),X2) != esk2_0
| app(X2,cons(X1,nil)) != esk1_0 ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_37,negated_conjecture,
( app(tl(esk2_0),cons(hd(esk2_0),nil)) = esk1_0
| esk2_0 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_28]),c_0_22])]) ).
fof(c_0_38,plain,
! [X33,X34] :
( ~ ssList(X33)
| ~ ssItem(X34)
| cons(X34,X33) = app(cons(X34,nil),X33) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax81])])])]) ).
fof(c_0_39,plain,
! [X1] :
( ssList(X1)
=> ( nil != X1
=> cons(hd(X1),tl(X1)) = X1 ) ),
inference(fof_simplification,[status(thm)],[ax78]) ).
cnf(c_0_40,negated_conjecture,
( esk2_0 = nil
| app(cons(hd(esk2_0),nil),tl(esk2_0)) != esk2_0
| ~ ssList(tl(esk2_0))
| ~ ssItem(hd(esk2_0)) ),
inference(spm,[status(thm)],[c_0_36,c_0_37]) ).
cnf(c_0_41,plain,
( cons(X2,X1) = app(cons(X2,nil),X1)
| ~ ssList(X1)
| ~ ssItem(X2) ),
inference(split_conjunct,[status(thm)],[c_0_38]) ).
fof(c_0_42,plain,
! [X67] :
( ~ ssList(X67)
| nil = X67
| cons(hd(X67),tl(X67)) = X67 ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_39])])]) ).
cnf(c_0_43,negated_conjecture,
( esk2_0 = nil
| cons(hd(esk2_0),tl(esk2_0)) != esk2_0
| ~ ssList(tl(esk2_0))
| ~ ssItem(hd(esk2_0)) ),
inference(spm,[status(thm)],[c_0_40,c_0_41]) ).
cnf(c_0_44,plain,
( nil = X1
| cons(hd(X1),tl(X1)) = X1
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_42]) ).
cnf(c_0_45,negated_conjecture,
( esk2_0 = nil
| ~ ssList(tl(esk2_0))
| ~ ssItem(hd(esk2_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_44]),c_0_22])]) ).
cnf(c_0_46,negated_conjecture,
( nil = esk3_0
| nil != esk4_0 ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_47,negated_conjecture,
( esk2_0 = nil
| ~ ssList(tl(esk2_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_28]),c_0_22])]) ).
cnf(c_0_48,negated_conjecture,
( esk1_0 = nil
| esk2_0 != nil ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_46,c_0_15]),c_0_16]) ).
cnf(c_0_49,negated_conjecture,
esk2_0 = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_31]),c_0_22])]) ).
cnf(c_0_50,plain,
( ~ neq(X1,X2)
| X1 != X2
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_51,negated_conjecture,
( neq(esk2_0,nil)
| nil != esk1_0 ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_52,negated_conjecture,
esk1_0 = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_48,c_0_49])]) ).
cnf(c_0_53,plain,
( ~ ssList(X1)
| ~ neq(X1,X1) ),
inference(er,[status(thm)],[c_0_50]) ).
cnf(c_0_54,negated_conjecture,
neq(nil,nil),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_51,c_0_49]),c_0_52])]) ).
cnf(c_0_55,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_54]),c_0_23])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SWC311+1 : TPTP v8.2.0. Released v2.4.0.
% 0.07/0.13 % Command : run_E %s %d THM
% 0.13/0.34 % Computer : n013.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 : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Sun May 19 03:21:23 EDT 2024
% 0.13/0.34 % CPUTime :
% 0.19/0.47 Running first-order model finding
% 0.19/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
% 0.19/0.50 # Version: 3.1.0
% 0.19/0.50 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.19/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.50 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.19/0.50 # Starting new_bool_3 with 300s (1) cores
% 0.19/0.50 # Starting new_bool_1 with 300s (1) cores
% 0.19/0.50 # Starting sh5l with 300s (1) cores
% 0.19/0.50 # new_bool_3 with pid 22020 completed with status 0
% 0.19/0.50 # Result found by new_bool_3
% 0.19/0.50 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.19/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.50 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.19/0.50 # Starting new_bool_3 with 300s (1) cores
% 0.19/0.50 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.19/0.50 # Search class: FGHSF-FFMM21-SFFFFFNN
% 0.19/0.50 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.19/0.50 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2v with 163s (1) cores
% 0.19/0.50 # G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2v with pid 22023 completed with status 0
% 0.19/0.50 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2v
% 0.19/0.50 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.19/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.50 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.19/0.50 # Starting new_bool_3 with 300s (1) cores
% 0.19/0.50 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.19/0.50 # Search class: FGHSF-FFMM21-SFFFFFNN
% 0.19/0.50 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.19/0.50 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2v with 163s (1) cores
% 0.19/0.50 # Preprocessing time : 0.002 s
% 0.19/0.50 # Presaturation interreduction done
% 0.19/0.50
% 0.19/0.50 # Proof found!
% 0.19/0.50 # SZS status Theorem
% 0.19/0.50 # SZS output start CNFRefutation
% See solution above
% 0.19/0.50 # Parsed axioms : 96
% 0.19/0.50 # Removed by relevancy pruning/SinE : 67
% 0.19/0.50 # Initial clauses : 51
% 0.19/0.50 # Removed in clause preprocessing : 0
% 0.19/0.50 # Initial clauses in saturation : 51
% 0.19/0.50 # Processed clauses : 139
% 0.19/0.50 # ...of these trivial : 2
% 0.19/0.50 # ...subsumed : 10
% 0.19/0.50 # ...remaining for further processing : 127
% 0.19/0.50 # Other redundant clauses eliminated : 22
% 0.19/0.50 # Clauses deleted for lack of memory : 0
% 0.19/0.50 # Backward-subsumed : 12
% 0.19/0.50 # Backward-rewritten : 14
% 0.19/0.50 # Generated clauses : 135
% 0.19/0.50 # ...of the previous two non-redundant : 108
% 0.19/0.50 # ...aggressively subsumed : 0
% 0.19/0.50 # Contextual simplify-reflections : 7
% 0.19/0.50 # Paramodulations : 112
% 0.19/0.50 # Factorizations : 0
% 0.19/0.50 # NegExts : 0
% 0.19/0.50 # Equation resolutions : 27
% 0.19/0.50 # Disequality decompositions : 0
% 0.19/0.50 # Total rewrite steps : 80
% 0.19/0.50 # ...of those cached : 73
% 0.19/0.50 # Propositional unsat checks : 0
% 0.19/0.50 # Propositional check models : 0
% 0.19/0.50 # Propositional check unsatisfiable : 0
% 0.19/0.50 # Propositional clauses : 0
% 0.19/0.50 # Propositional clauses after purity: 0
% 0.19/0.50 # Propositional unsat core size : 0
% 0.19/0.50 # Propositional preprocessing time : 0.000
% 0.19/0.50 # Propositional encoding time : 0.000
% 0.19/0.50 # Propositional solver time : 0.000
% 0.19/0.50 # Success case prop preproc time : 0.000
% 0.19/0.50 # Success case prop encoding time : 0.000
% 0.19/0.50 # Success case prop solver time : 0.000
% 0.19/0.50 # Current number of processed clauses : 48
% 0.19/0.50 # Positive orientable unit clauses : 9
% 0.19/0.50 # Positive unorientable unit clauses: 0
% 0.19/0.50 # Negative unit clauses : 1
% 0.19/0.50 # Non-unit-clauses : 38
% 0.19/0.50 # Current number of unprocessed clauses: 68
% 0.19/0.50 # ...number of literals in the above : 383
% 0.19/0.50 # Current number of archived formulas : 0
% 0.19/0.50 # Current number of archived clauses : 75
% 0.19/0.50 # Clause-clause subsumption calls (NU) : 1193
% 0.19/0.50 # Rec. Clause-clause subsumption calls : 277
% 0.19/0.50 # Non-unit clause-clause subsumptions : 29
% 0.19/0.50 # Unit Clause-clause subsumption calls : 42
% 0.19/0.50 # Rewrite failures with RHS unbound : 0
% 0.19/0.50 # BW rewrite match attempts : 2
% 0.19/0.50 # BW rewrite match successes : 2
% 0.19/0.50 # Condensation attempts : 0
% 0.19/0.50 # Condensation successes : 0
% 0.19/0.50 # Termbank termtop insertions : 7691
% 0.19/0.50 # Search garbage collected termcells : 1647
% 0.19/0.50
% 0.19/0.50 # -------------------------------------------------
% 0.19/0.50 # User time : 0.014 s
% 0.19/0.50 # System time : 0.004 s
% 0.19/0.50 # Total time : 0.017 s
% 0.19/0.50 # Maximum resident set size: 2020 pages
% 0.19/0.50
% 0.19/0.50 # -------------------------------------------------
% 0.19/0.50 # User time : 0.018 s
% 0.19/0.50 # System time : 0.005 s
% 0.19/0.50 # Total time : 0.023 s
% 0.19/0.50 # Maximum resident set size: 1828 pages
% 0.19/0.50 % E---3.1 exiting
%------------------------------------------------------------------------------