TSTP Solution File: SWC022-1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SWC022-1 : TPTP v8.2.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n021.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:22:38 EDT 2024
% Result : Unsatisfiable 0.22s 0.56s
% Output : CNFRefutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 20
% Number of leaves : 20
% Syntax : Number of clauses : 82 ( 18 unt; 27 nHn; 82 RR)
% Number of literals : 222 ( 70 equ; 124 neg)
% Maximal clause size : 7 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 5 con; 0-2 aty)
% Number of variables : 73 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(co1_7,negated_conjecture,
( neq(sk2,nil)
| neq(sk2,nil) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_7) ).
cnf(co1_12,negated_conjecture,
( sk3 = X1
| ~ ssList(X1)
| ~ ssItem(X2)
| cons(X2,nil) != X1
| hd(sk4) != X2
| ~ neq(nil,sk4)
| ~ neq(sk4,nil) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_12) ).
cnf(co1_5,negated_conjecture,
sk2 = sk4,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_5) ).
cnf(co1_6,negated_conjecture,
sk1 = sk3,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_6) ).
cnf(clause100,axiom,
( neq(X2,X1)
| X2 = X1
| ~ ssList(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause100) ).
cnf(co1_2,negated_conjecture,
ssList(sk2),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_2) ).
cnf(clause8,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause8) ).
cnf(clause76,axiom,
( ssItem(hd(X1))
| nil = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause76) ).
cnf(clause86,axiom,
( ssList(cons(X1,X2))
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause86) ).
cnf(clause97,axiom,
( hd(cons(X1,X2)) = X1
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause97) ).
cnf(clause104,axiom,
( cons(hd(X1),tl(X1)) = X1
| nil = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause104) ).
cnf(clause120,axiom,
( app(cons(X1,nil),X2) = cons(X1,X2)
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause120) ).
cnf(clause144,axiom,
( frontsegP(X3,X1)
| app(X1,X2) != X3
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(X3) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause144) ).
cnf(clause85,axiom,
( ssList(app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause85) ).
cnf(clause75,axiom,
( ssList(tl(X1))
| nil = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause75) ).
cnf(co1_11,negated_conjecture,
( ~ ssList(X1)
| ~ neq(X1,nil)
| ~ frontsegP(sk2,X1)
| ~ frontsegP(sk1,X1)
| ~ neq(sk4,nil) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_11) ).
cnf(clause61,axiom,
( frontsegP(X1,X1)
| ~ ssList(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause61) ).
cnf(co1_1,negated_conjecture,
ssList(sk1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_1) ).
cnf(clause60,axiom,
( frontsegP(X1,nil)
| ~ ssList(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause60) ).
cnf(clause98,axiom,
( cons(X1,X2) != nil
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause98) ).
cnf(c_0_20,negated_conjecture,
neq(sk2,nil),
inference(fof_simplification,[status(thm)],[co1_7]) ).
cnf(c_0_21,negated_conjecture,
( sk3 = X1
| ~ ssList(X1)
| ~ ssItem(X2)
| cons(X2,nil) != X1
| hd(sk4) != X2
| ~ neq(nil,sk4)
| ~ neq(sk4,nil) ),
inference(fof_simplification,[status(thm)],[co1_12]) ).
cnf(c_0_22,negated_conjecture,
neq(sk2,nil),
c_0_20 ).
cnf(c_0_23,negated_conjecture,
sk2 = sk4,
co1_5 ).
cnf(c_0_24,negated_conjecture,
( sk3 = X1
| ~ ssList(X1)
| ~ ssItem(X2)
| cons(X2,nil) != X1
| hd(sk4) != X2
| ~ neq(nil,sk4)
| ~ neq(sk4,nil) ),
c_0_21 ).
cnf(c_0_25,negated_conjecture,
sk1 = sk3,
co1_6 ).
cnf(c_0_26,negated_conjecture,
neq(sk4,nil),
inference(rw,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_27,plain,
( neq(X2,X1)
| X2 = X1
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(fof_simplification,[status(thm)],[clause100]) ).
cnf(c_0_28,negated_conjecture,
ssList(sk2),
co1_2 ).
cnf(c_0_29,negated_conjecture,
( cons(hd(sk4),nil) = sk1
| ~ neq(nil,sk4)
| ~ ssItem(hd(sk4))
| ~ ssList(cons(hd(sk4),nil)) ),
inference(er,[status(thm)],[inference(er,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_24,c_0_25]),c_0_26])])])]) ).
cnf(c_0_30,plain,
( neq(X2,X1)
| X2 = X1
| ~ ssList(X1)
| ~ ssList(X2) ),
c_0_27 ).
cnf(c_0_31,axiom,
ssList(nil),
clause8 ).
cnf(c_0_32,negated_conjecture,
ssList(sk4),
inference(rw,[status(thm)],[c_0_28,c_0_23]) ).
cnf(c_0_33,plain,
( ssItem(hd(X1))
| nil = X1
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause76]) ).
cnf(c_0_34,negated_conjecture,
( cons(hd(sk4),nil) = sk1
| nil = sk4
| ~ ssItem(hd(sk4))
| ~ ssList(cons(hd(sk4),nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_31]),c_0_32])]) ).
cnf(c_0_35,plain,
( ssItem(hd(X1))
| nil = X1
| ~ ssList(X1) ),
c_0_33 ).
cnf(c_0_36,plain,
( ssList(cons(X1,X2))
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(fof_simplification,[status(thm)],[clause86]) ).
cnf(c_0_37,negated_conjecture,
( cons(hd(sk4),nil) = sk1
| nil = sk4
| ~ ssList(cons(hd(sk4),nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_32])]) ).
cnf(c_0_38,plain,
( ssList(cons(X1,X2))
| ~ ssItem(X1)
| ~ ssList(X2) ),
c_0_36 ).
cnf(c_0_39,plain,
( hd(cons(X1,X2)) = X1
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(fof_simplification,[status(thm)],[clause97]) ).
cnf(c_0_40,negated_conjecture,
( cons(hd(sk4),nil) = sk1
| nil = sk4
| ~ ssItem(hd(sk4)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_38]),c_0_31])]) ).
cnf(c_0_41,plain,
( hd(cons(X1,X2)) = X1
| ~ ssItem(X1)
| ~ ssList(X2) ),
c_0_39 ).
cnf(c_0_42,negated_conjecture,
( cons(hd(sk4),nil) = sk1
| nil = sk4 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_35]),c_0_32])]) ).
cnf(c_0_43,negated_conjecture,
( hd(sk4) = hd(sk1)
| nil = sk4
| ~ ssItem(hd(sk4)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_42]),c_0_31])]) ).
cnf(c_0_44,plain,
( cons(hd(X1),tl(X1)) = X1
| nil = X1
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause104]) ).
cnf(c_0_45,plain,
( app(cons(X1,nil),X2) = cons(X1,X2)
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(fof_simplification,[status(thm)],[clause120]) ).
cnf(c_0_46,negated_conjecture,
( hd(sk4) = hd(sk1)
| nil = sk4 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_35]),c_0_32])]) ).
cnf(c_0_47,plain,
( cons(hd(X1),tl(X1)) = X1
| nil = X1
| ~ ssList(X1) ),
c_0_44 ).
cnf(c_0_48,plain,
( app(cons(X1,nil),X2) = cons(X1,X2)
| ~ ssItem(X1)
| ~ ssList(X2) ),
c_0_45 ).
cnf(c_0_49,negated_conjecture,
( cons(hd(sk1),nil) = sk1
| nil = sk4 ),
inference(spm,[status(thm)],[c_0_42,c_0_46]) ).
cnf(c_0_50,negated_conjecture,
( nil = sk4
| ssItem(hd(sk1)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_46]),c_0_32])]) ).
cnf(c_0_51,plain,
( frontsegP(X3,X1)
| app(X1,X2) != X3
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(X3) ),
inference(fof_simplification,[status(thm)],[clause144]) ).
cnf(c_0_52,plain,
( ssList(app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(fof_simplification,[status(thm)],[clause85]) ).
cnf(c_0_53,negated_conjecture,
( cons(hd(sk1),tl(sk4)) = sk4
| nil = sk4 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_46]),c_0_32])]) ).
cnf(c_0_54,negated_conjecture,
( cons(hd(sk1),X1) = app(sk1,X1)
| nil = sk4
| ~ ssList(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_49]),c_0_50]) ).
cnf(c_0_55,plain,
( ssList(tl(X1))
| nil = X1
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause75]) ).
cnf(c_0_56,negated_conjecture,
( ~ ssList(X1)
| ~ neq(X1,nil)
| ~ frontsegP(sk2,X1)
| ~ frontsegP(sk1,X1)
| ~ neq(sk4,nil) ),
inference(fof_simplification,[status(thm)],[co1_11]) ).
cnf(c_0_57,plain,
( frontsegP(X3,X1)
| app(X1,X2) != X3
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(X3) ),
c_0_51 ).
cnf(c_0_58,plain,
( ssList(app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2) ),
c_0_52 ).
cnf(c_0_59,negated_conjecture,
( app(sk1,tl(sk4)) = sk4
| nil = sk4
| ~ ssList(tl(sk4)) ),
inference(spm,[status(thm)],[c_0_53,c_0_54]) ).
cnf(c_0_60,plain,
( ssList(tl(X1))
| nil = X1
| ~ ssList(X1) ),
c_0_55 ).
cnf(c_0_61,negated_conjecture,
( ~ ssList(X1)
| ~ neq(X1,nil)
| ~ frontsegP(sk2,X1)
| ~ frontsegP(sk1,X1)
| ~ neq(sk4,nil) ),
c_0_56 ).
cnf(c_0_62,plain,
( frontsegP(X1,X1)
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause61]) ).
cnf(c_0_63,plain,
( frontsegP(app(X1,X2),X1)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(csr,[status(thm)],[inference(er,[status(thm)],[c_0_57]),c_0_58]) ).
cnf(c_0_64,negated_conjecture,
( app(sk1,tl(sk4)) = sk4
| nil = sk4 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_59,c_0_60]),c_0_32])]) ).
cnf(c_0_65,negated_conjecture,
ssList(sk1),
co1_1 ).
cnf(c_0_66,plain,
( frontsegP(X1,nil)
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause60]) ).
cnf(c_0_67,negated_conjecture,
( ~ neq(X1,nil)
| ~ frontsegP(sk1,X1)
| ~ frontsegP(sk4,X1)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_61,c_0_23]),c_0_26])]) ).
cnf(c_0_68,plain,
( frontsegP(X1,X1)
| ~ ssList(X1) ),
c_0_62 ).
cnf(c_0_69,negated_conjecture,
( nil = sk4
| frontsegP(sk4,sk1)
| ~ ssList(tl(sk4)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_63,c_0_64]),c_0_65])]) ).
cnf(c_0_70,plain,
( cons(X1,X2) != nil
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(fof_simplification,[status(thm)],[clause98]) ).
cnf(c_0_71,plain,
( frontsegP(X1,nil)
| ~ ssList(X1) ),
c_0_66 ).
cnf(c_0_72,negated_conjecture,
( ~ neq(sk1,nil)
| ~ frontsegP(sk4,sk1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_67,c_0_68]),c_0_65])]) ).
cnf(c_0_73,negated_conjecture,
( nil = sk4
| frontsegP(sk4,sk1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_69,c_0_60]),c_0_32])]) ).
cnf(c_0_74,plain,
( cons(X1,X2) != nil
| ~ ssItem(X1)
| ~ ssList(X2) ),
c_0_70 ).
cnf(c_0_75,negated_conjecture,
( ~ neq(nil,nil)
| ~ frontsegP(sk4,nil) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_67,c_0_71]),c_0_31]),c_0_65])]) ).
cnf(c_0_76,negated_conjecture,
( nil = sk4
| ~ neq(sk1,nil) ),
inference(spm,[status(thm)],[c_0_72,c_0_73]) ).
cnf(c_0_77,negated_conjecture,
( nil = sk4
| nil != sk1 ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_74,c_0_49]),c_0_31])]),c_0_50]) ).
cnf(c_0_78,negated_conjecture,
~ neq(nil,nil),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_75,c_0_71]),c_0_32])]) ).
cnf(c_0_79,negated_conjecture,
nil = sk4,
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_76,c_0_30]),c_0_65]),c_0_31])]),c_0_77]) ).
cnf(c_0_80,negated_conjecture,
~ neq(sk4,sk4),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_78,c_0_79]),c_0_79]) ).
cnf(c_0_81,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_26,c_0_79]),c_0_80]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : SWC022-1 : TPTP v8.2.0. Released v2.4.0.
% 0.08/0.14 % Command : run_E %s %d THM
% 0.14/0.36 % Computer : n021.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 : 300
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Sun May 19 02:52:38 EDT 2024
% 0.14/0.36 % CPUTime :
% 0.22/0.50 Running first-order theorem proving
% 0.22/0.50 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/benchmark/theBenchmark.p
% 0.22/0.56 # Version: 3.1.0
% 0.22/0.56 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.22/0.56 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.56 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.22/0.56 # Starting new_bool_3 with 300s (1) cores
% 0.22/0.56 # Starting new_bool_1 with 300s (1) cores
% 0.22/0.56 # Starting sh5l with 300s (1) cores
% 0.22/0.56 # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 26880 completed with status 0
% 0.22/0.56 # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.22/0.56 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.22/0.56 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.56 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.22/0.56 # No SInE strategy applied
% 0.22/0.56 # Search class: FGHSM-FSLM21-MFFFFFNN
% 0.22/0.56 # Scheduled 9 strats onto 5 cores with 1500 seconds (1500 total)
% 0.22/0.56 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2s with 406s (1) cores
% 0.22/0.56 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.22/0.56 # Starting G-E--_200_B02_F1_SE_CS_SP_PI_S2k with 136s (1) cores
% 0.22/0.56 # Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S04BN with 136s (1) cores
% 0.22/0.56 # Starting G-E--_200_B02_F1_SE_CS_SP_PI_S0S with 136s (1) cores
% 0.22/0.56 # G-E--_200_B02_F1_SE_CS_SP_PI_S2k with pid 26888 completed with status 0
% 0.22/0.56 # Result found by G-E--_200_B02_F1_SE_CS_SP_PI_S2k
% 0.22/0.56 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.22/0.56 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.56 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.22/0.56 # No SInE strategy applied
% 0.22/0.56 # Search class: FGHSM-FSLM21-MFFFFFNN
% 0.22/0.56 # Scheduled 9 strats onto 5 cores with 1500 seconds (1500 total)
% 0.22/0.56 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2s with 406s (1) cores
% 0.22/0.56 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.22/0.56 # Starting G-E--_200_B02_F1_SE_CS_SP_PI_S2k with 136s (1) cores
% 0.22/0.56 # Preprocessing time : 0.003 s
% 0.22/0.56
% 0.22/0.56 # Proof found!
% 0.22/0.56 # SZS status Unsatisfiable
% 0.22/0.56 # SZS output start CNFRefutation
% See solution above
% 0.22/0.56 # Parsed axioms : 197
% 0.22/0.56 # Removed by relevancy pruning/SinE : 0
% 0.22/0.56 # Initial clauses : 197
% 0.22/0.56 # Removed in clause preprocessing : 0
% 0.22/0.56 # Initial clauses in saturation : 197
% 0.22/0.56 # Processed clauses : 559
% 0.22/0.56 # ...of these trivial : 5
% 0.22/0.56 # ...subsumed : 186
% 0.22/0.56 # ...remaining for further processing : 367
% 0.22/0.56 # Other redundant clauses eliminated : 82
% 0.22/0.56 # Clauses deleted for lack of memory : 0
% 0.22/0.56 # Backward-subsumed : 26
% 0.22/0.56 # Backward-rewritten : 138
% 0.22/0.56 # Generated clauses : 1419
% 0.22/0.56 # ...of the previous two non-redundant : 1322
% 0.22/0.56 # ...aggressively subsumed : 0
% 0.22/0.56 # Contextual simplify-reflections : 45
% 0.22/0.56 # Paramodulations : 1331
% 0.22/0.56 # Factorizations : 0
% 0.22/0.56 # NegExts : 0
% 0.22/0.56 # Equation resolutions : 90
% 0.22/0.56 # Disequality decompositions : 0
% 0.22/0.56 # Total rewrite steps : 1387
% 0.22/0.56 # ...of those cached : 1309
% 0.22/0.56 # Propositional unsat checks : 0
% 0.22/0.56 # Propositional check models : 0
% 0.22/0.56 # Propositional check unsatisfiable : 0
% 0.22/0.56 # Propositional clauses : 0
% 0.22/0.56 # Propositional clauses after purity: 0
% 0.22/0.56 # Propositional unsat core size : 0
% 0.22/0.56 # Propositional preprocessing time : 0.000
% 0.22/0.56 # Propositional encoding time : 0.000
% 0.22/0.56 # Propositional solver time : 0.000
% 0.22/0.56 # Success case prop preproc time : 0.000
% 0.22/0.56 # Success case prop encoding time : 0.000
% 0.22/0.56 # Success case prop solver time : 0.000
% 0.22/0.56 # Current number of processed clauses : 179
% 0.22/0.56 # Positive orientable unit clauses : 56
% 0.22/0.56 # Positive unorientable unit clauses: 0
% 0.22/0.56 # Negative unit clauses : 3
% 0.22/0.56 # Non-unit-clauses : 120
% 0.22/0.56 # Current number of unprocessed clauses: 932
% 0.22/0.56 # ...number of literals in the above : 5166
% 0.22/0.56 # Current number of archived formulas : 0
% 0.22/0.56 # Current number of archived clauses : 164
% 0.22/0.56 # Clause-clause subsumption calls (NU) : 12123
% 0.22/0.56 # Rec. Clause-clause subsumption calls : 3064
% 0.22/0.56 # Non-unit clause-clause subsumptions : 224
% 0.22/0.56 # Unit Clause-clause subsumption calls : 488
% 0.22/0.56 # Rewrite failures with RHS unbound : 0
% 0.22/0.56 # BW rewrite match attempts : 3
% 0.22/0.56 # BW rewrite match successes : 3
% 0.22/0.56 # Condensation attempts : 0
% 0.22/0.56 # Condensation successes : 0
% 0.22/0.56 # Termbank termtop insertions : 32384
% 0.22/0.56 # Search garbage collected termcells : 561
% 0.22/0.56
% 0.22/0.56 # -------------------------------------------------
% 0.22/0.56 # User time : 0.042 s
% 0.22/0.56 # System time : 0.003 s
% 0.22/0.56 # Total time : 0.045 s
% 0.22/0.56 # Maximum resident set size: 2152 pages
% 0.22/0.56
% 0.22/0.56 # -------------------------------------------------
% 0.22/0.56 # User time : 0.198 s
% 0.22/0.56 # System time : 0.014 s
% 0.22/0.56 # Total time : 0.212 s
% 0.22/0.56 # Maximum resident set size: 1876 pages
% 0.22/0.56 % E---3.1 exiting
% 0.22/0.56 % E exiting
%------------------------------------------------------------------------------