TSTP Solution File: SWC233-1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SWC233-1 : TPTP v8.2.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n009.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:24:42 EDT 2024
% Result : Unsatisfiable 0.14s 0.48s
% Output : CNFRefutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 18
% Syntax : Number of clauses : 74 ( 10 unt; 9 nHn; 74 RR)
% Number of literals : 211 ( 58 equ; 139 neg)
% Maximal clause size : 5 ( 2 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 2 con; 0-3 aty)
% Number of variables : 108 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
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(clause157,axiom,
( cons(X1,app(X2,X3)) = app(cons(X1,X2),X3)
| ~ ssItem(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause157) ).
cnf(clause96,axiom,
( tl(cons(X1,X2)) = X2
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause96) ).
cnf(clause8,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause8) ).
cnf(clause99,axiom,
( cons(X1,X2) != X2
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause99) ).
cnf(clause73,axiom,
( app(X1,nil) = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause73) ).
cnf(clause104,axiom,
( cons(hd(X1),tl(X1)) = X1
| nil = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause104) ).
cnf(clause86,axiom,
( ssList(cons(X1,X2))
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause86) ).
cnf(clause149,axiom,
( app(app(X3,X2),X1) = app(X3,app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause149) ).
cnf(clause74,axiom,
( app(nil,X1) = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause74) ).
cnf(clause97,axiom,
( hd(cons(X1,X2)) = X1
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause97) ).
cnf(co1_9,negated_conjecture,
( memberP(X2,sk5(X3,X2,X1))
| ~ ssItem(X1)
| ~ ssList(X2)
| ~ ssList(X3)
| app(app(X2,cons(X1,nil)),X3) != sk1 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_9) ).
cnf(co1_8,negated_conjecture,
( ssItem(sk5(X3,X2,X1))
| ~ ssItem(X1)
| ~ ssList(X2)
| ~ ssList(X3)
| app(app(X2,cons(X1,nil)),X3) != sk1 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_8) ).
cnf(co1_7,negated_conjecture,
nil != sk1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_7) ).
cnf(co1_1,negated_conjecture,
ssList(sk1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_1) ).
cnf(clause76,axiom,
( ssItem(hd(X1))
| nil = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause76) ).
cnf(clause75,axiom,
( ssList(tl(X1))
| nil = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause75) ).
cnf(clause71,axiom,
( ~ memberP(nil,X1)
| ~ ssItem(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause71) ).
cnf(c_0_18,plain,
( app(cons(X1,nil),X2) = cons(X1,X2)
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(fof_simplification,[status(thm)],[clause120]) ).
cnf(c_0_19,plain,
( cons(X1,app(X2,X3)) = app(cons(X1,X2),X3)
| ~ ssItem(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
inference(fof_simplification,[status(thm)],[clause157]) ).
cnf(c_0_20,plain,
( tl(cons(X1,X2)) = X2
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(fof_simplification,[status(thm)],[clause96]) ).
cnf(c_0_21,plain,
( app(cons(X1,nil),X2) = cons(X1,X2)
| ~ ssItem(X1)
| ~ ssList(X2) ),
c_0_18 ).
cnf(c_0_22,plain,
( cons(X1,app(X2,X3)) = app(cons(X1,X2),X3)
| ~ ssItem(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
c_0_19 ).
cnf(c_0_23,axiom,
ssList(nil),
clause8 ).
cnf(c_0_24,plain,
( cons(X1,X2) != X2
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(fof_simplification,[status(thm)],[clause99]) ).
cnf(c_0_25,plain,
( tl(cons(X1,X2)) = X2
| ~ ssItem(X1)
| ~ ssList(X2) ),
c_0_20 ).
cnf(c_0_26,plain,
( cons(X1,app(nil,X2)) = cons(X1,X2)
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_23])]) ).
cnf(c_0_27,plain,
( app(X1,nil) = X1
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause73]) ).
cnf(c_0_28,plain,
( cons(X1,X2) != X2
| ~ ssItem(X1)
| ~ ssList(X2) ),
c_0_24 ).
cnf(c_0_29,plain,
( cons(hd(X1),tl(X1)) = X1
| nil = X1
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause104]) ).
cnf(c_0_30,plain,
( tl(cons(X1,X2)) = app(nil,X2)
| ~ ssItem(X1)
| ~ ssList(app(nil,X2))
| ~ ssList(X2) ),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_31,plain,
( app(X1,nil) = X1
| ~ ssList(X1) ),
c_0_27 ).
cnf(c_0_32,plain,
( cons(X1,X2) != app(nil,X2)
| ~ ssItem(X1)
| ~ ssList(app(nil,X2))
| ~ ssList(X2) ),
inference(spm,[status(thm)],[c_0_28,c_0_26]) ).
cnf(c_0_33,plain,
( cons(hd(X1),tl(X1)) = X1
| nil = X1
| ~ ssList(X1) ),
c_0_29 ).
cnf(c_0_34,plain,
( tl(cons(X1,nil)) = nil
| ~ ssItem(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_23])]) ).
cnf(c_0_35,plain,
( cons(X1,nil) != nil
| ~ ssItem(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_31]),c_0_23])]) ).
cnf(c_0_36,plain,
( ssList(cons(X1,X2))
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(fof_simplification,[status(thm)],[clause86]) ).
cnf(c_0_37,plain,
( cons(hd(cons(X1,nil)),nil) = cons(X1,nil)
| ~ ssItem(X1)
| ~ ssList(cons(X1,nil)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_35]) ).
cnf(c_0_38,plain,
( ssList(cons(X1,X2))
| ~ ssItem(X1)
| ~ ssList(X2) ),
c_0_36 ).
cnf(c_0_39,plain,
( app(app(X3,X2),X1) = app(X3,app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
inference(fof_simplification,[status(thm)],[clause149]) ).
cnf(c_0_40,plain,
( app(nil,X1) = X1
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause74]) ).
cnf(c_0_41,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_37,c_0_38]),c_0_23])]) ).
cnf(c_0_42,plain,
( hd(cons(X1,X2)) = X1
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(fof_simplification,[status(thm)],[clause97]) ).
cnf(c_0_43,plain,
( app(app(X3,X2),X1) = app(X3,app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
c_0_39 ).
cnf(c_0_44,plain,
( app(nil,X1) = X1
| ~ ssList(X1) ),
c_0_40 ).
cnf(c_0_45,plain,
( ssList(cons(X1,nil))
| ~ ssItem(hd(cons(X1,nil)))
| ~ ssItem(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_41]),c_0_23])]) ).
cnf(c_0_46,plain,
( hd(cons(X1,X2)) = X1
| ~ ssItem(X1)
| ~ ssList(X2) ),
c_0_42 ).
cnf(c_0_47,negated_conjecture,
( memberP(X2,sk5(X3,X2,X1))
| ~ ssItem(X1)
| ~ ssList(X2)
| ~ ssList(X3)
| app(app(X2,cons(X1,nil)),X3) != sk1 ),
inference(fof_simplification,[status(thm)],[co1_9]) ).
cnf(c_0_48,plain,
( app(nil,app(X1,X2)) = app(X1,X2)
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_44]),c_0_23])]) ).
cnf(c_0_49,plain,
( ssList(cons(X1,nil))
| ~ ssItem(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_46]),c_0_23])]) ).
cnf(c_0_50,negated_conjecture,
( ssItem(sk5(X3,X2,X1))
| ~ ssItem(X1)
| ~ ssList(X2)
| ~ ssList(X3)
| app(app(X2,cons(X1,nil)),X3) != sk1 ),
inference(fof_simplification,[status(thm)],[co1_8]) ).
cnf(c_0_51,negated_conjecture,
( memberP(X2,sk5(X3,X2,X1))
| ~ ssItem(X1)
| ~ ssList(X2)
| ~ ssList(X3)
| app(app(X2,cons(X1,nil)),X3) != sk1 ),
c_0_47 ).
cnf(c_0_52,plain,
( app(nil,cons(X1,X2)) = cons(X1,X2)
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_21]),c_0_49]) ).
cnf(c_0_53,negated_conjecture,
( ssItem(sk5(X3,X2,X1))
| ~ ssItem(X1)
| ~ ssList(X2)
| ~ ssList(X3)
| app(app(X2,cons(X1,nil)),X3) != sk1 ),
c_0_50 ).
cnf(c_0_54,negated_conjecture,
( memberP(nil,sk5(X1,nil,X2))
| app(cons(X2,nil),X1) != sk1
| ~ ssItem(X2)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_52]),c_0_23])]) ).
cnf(c_0_55,negated_conjecture,
nil != sk1,
inference(fof_simplification,[status(thm)],[co1_7]) ).
cnf(c_0_56,negated_conjecture,
( ssItem(sk5(X1,nil,X2))
| app(cons(X2,nil),X1) != sk1
| ~ ssItem(X2)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_52]),c_0_23])]) ).
cnf(c_0_57,negated_conjecture,
( memberP(nil,sk5(X1,nil,X2))
| cons(X2,X1) != sk1
| ~ ssItem(X2)
| ~ ssList(X1) ),
inference(spm,[status(thm)],[c_0_54,c_0_21]) ).
cnf(c_0_58,negated_conjecture,
ssList(sk1),
co1_1 ).
cnf(c_0_59,negated_conjecture,
nil != sk1,
c_0_55 ).
cnf(c_0_60,plain,
( ssItem(hd(X1))
| nil = X1
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause76]) ).
cnf(c_0_61,negated_conjecture,
( ssItem(sk5(X1,nil,X2))
| cons(X2,X1) != sk1
| ~ ssItem(X2)
| ~ ssList(X1) ),
inference(spm,[status(thm)],[c_0_56,c_0_21]) ).
cnf(c_0_62,negated_conjecture,
( memberP(nil,sk5(tl(sk1),nil,hd(sk1)))
| ~ ssItem(hd(sk1))
| ~ ssList(tl(sk1)) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_57,c_0_33])]),c_0_58])]),c_0_59]) ).
cnf(c_0_63,plain,
( ssItem(hd(X1))
| nil = X1
| ~ ssList(X1) ),
c_0_60 ).
cnf(c_0_64,plain,
( ssList(tl(X1))
| nil = X1
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause75]) ).
cnf(c_0_65,negated_conjecture,
( ssItem(sk5(tl(sk1),nil,hd(sk1)))
| ~ ssItem(hd(sk1))
| ~ ssList(tl(sk1)) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_61,c_0_33])]),c_0_58])]),c_0_59]) ).
cnf(c_0_66,plain,
( ~ memberP(nil,X1)
| ~ ssItem(X1) ),
inference(fof_simplification,[status(thm)],[clause71]) ).
cnf(c_0_67,negated_conjecture,
( memberP(nil,sk5(tl(sk1),nil,hd(sk1)))
| ~ ssList(tl(sk1)) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_62,c_0_63]),c_0_58])]),c_0_59]) ).
cnf(c_0_68,plain,
( ssList(tl(X1))
| nil = X1
| ~ ssList(X1) ),
c_0_64 ).
cnf(c_0_69,negated_conjecture,
( ssItem(sk5(tl(sk1),nil,hd(sk1)))
| ~ ssList(tl(sk1)) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_65,c_0_63]),c_0_58])]),c_0_59]) ).
cnf(c_0_70,plain,
( ~ memberP(nil,X1)
| ~ ssItem(X1) ),
c_0_66 ).
cnf(c_0_71,negated_conjecture,
memberP(nil,sk5(tl(sk1),nil,hd(sk1))),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_67,c_0_68]),c_0_58])]),c_0_59]) ).
cnf(c_0_72,negated_conjecture,
ssItem(sk5(tl(sk1),nil,hd(sk1))),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_69,c_0_68]),c_0_58])]),c_0_59]) ).
cnf(c_0_73,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_70,c_0_71]),c_0_72])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.09 % Problem : SWC233-1 : TPTP v8.2.0. Released v2.4.0.
% 0.05/0.10 % Command : run_E %s %d THM
% 0.10/0.30 % Computer : n009.cluster.edu
% 0.10/0.30 % Model : x86_64 x86_64
% 0.10/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.30 % Memory : 8042.1875MB
% 0.10/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.30 % CPULimit : 300
% 0.10/0.30 % WCLimit : 300
% 0.10/0.30 % DateTime : Sun May 19 02:34:52 EDT 2024
% 0.10/0.30 % CPUTime :
% 0.14/0.41 Running first-order theorem proving
% 0.14/0.41 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.14/0.48 # Version: 3.1.0
% 0.14/0.48 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.14/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.48 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.14/0.48 # Starting new_bool_3 with 300s (1) cores
% 0.14/0.48 # Starting new_bool_1 with 300s (1) cores
% 0.14/0.48 # Starting sh5l with 300s (1) cores
% 0.14/0.48 # sh5l with pid 1361 completed with status 0
% 0.14/0.48 # Result found by sh5l
% 0.14/0.48 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.14/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.48 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.14/0.48 # Starting new_bool_3 with 300s (1) cores
% 0.14/0.48 # Starting new_bool_1 with 300s (1) cores
% 0.14/0.48 # Starting sh5l with 300s (1) cores
% 0.14/0.48 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.14/0.48 # Search class: FGHSM-FSLM31-MFFFFFNN
% 0.14/0.48 # Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.14/0.48 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with 135s (1) cores
% 0.14/0.48 # G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with pid 1364 completed with status 0
% 0.14/0.48 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d
% 0.14/0.48 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.14/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.48 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.14/0.48 # Starting new_bool_3 with 300s (1) cores
% 0.14/0.48 # Starting new_bool_1 with 300s (1) cores
% 0.14/0.48 # Starting sh5l with 300s (1) cores
% 0.14/0.48 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.14/0.48 # Search class: FGHSM-FSLM31-MFFFFFNN
% 0.14/0.48 # Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.14/0.48 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with 135s (1) cores
% 0.14/0.48 # Preprocessing time : 0.002 s
% 0.14/0.48 # Presaturation interreduction done
% 0.14/0.48
% 0.14/0.48 # Proof found!
% 0.14/0.48 # SZS status Unsatisfiable
% 0.14/0.48 # SZS output start CNFRefutation
% See solution above
% 0.14/0.48 # Parsed axioms : 199
% 0.14/0.48 # Removed by relevancy pruning/SinE : 58
% 0.14/0.48 # Initial clauses : 141
% 0.14/0.48 # Removed in clause preprocessing : 0
% 0.14/0.48 # Initial clauses in saturation : 141
% 0.14/0.48 # Processed clauses : 664
% 0.14/0.48 # ...of these trivial : 2
% 0.14/0.48 # ...subsumed : 281
% 0.14/0.48 # ...remaining for further processing : 381
% 0.14/0.48 # Other redundant clauses eliminated : 45
% 0.14/0.48 # Clauses deleted for lack of memory : 0
% 0.14/0.48 # Backward-subsumed : 17
% 0.14/0.48 # Backward-rewritten : 2
% 0.14/0.48 # Generated clauses : 1290
% 0.14/0.48 # ...of the previous two non-redundant : 1147
% 0.14/0.48 # ...aggressively subsumed : 0
% 0.14/0.48 # Contextual simplify-reflections : 35
% 0.14/0.48 # Paramodulations : 1238
% 0.14/0.48 # Factorizations : 0
% 0.14/0.48 # NegExts : 0
% 0.14/0.48 # Equation resolutions : 53
% 0.14/0.48 # Disequality decompositions : 0
% 0.14/0.48 # Total rewrite steps : 779
% 0.14/0.48 # ...of those cached : 729
% 0.14/0.48 # Propositional unsat checks : 0
% 0.14/0.48 # Propositional check models : 0
% 0.14/0.48 # Propositional check unsatisfiable : 0
% 0.14/0.48 # Propositional clauses : 0
% 0.14/0.48 # Propositional clauses after purity: 0
% 0.14/0.48 # Propositional unsat core size : 0
% 0.14/0.48 # Propositional preprocessing time : 0.000
% 0.14/0.48 # Propositional encoding time : 0.000
% 0.14/0.48 # Propositional solver time : 0.000
% 0.14/0.48 # Success case prop preproc time : 0.000
% 0.14/0.48 # Success case prop encoding time : 0.000
% 0.14/0.48 # Success case prop solver time : 0.000
% 0.14/0.48 # Current number of processed clauses : 215
% 0.14/0.48 # Positive orientable unit clauses : 39
% 0.14/0.48 # Positive unorientable unit clauses: 0
% 0.14/0.48 # Negative unit clauses : 1
% 0.14/0.48 # Non-unit-clauses : 175
% 0.14/0.48 # Current number of unprocessed clauses: 741
% 0.14/0.48 # ...number of literals in the above : 4650
% 0.14/0.48 # Current number of archived formulas : 0
% 0.14/0.48 # Current number of archived clauses : 152
% 0.14/0.48 # Clause-clause subsumption calls (NU) : 11464
% 0.14/0.48 # Rec. Clause-clause subsumption calls : 2439
% 0.14/0.48 # Non-unit clause-clause subsumptions : 333
% 0.14/0.48 # Unit Clause-clause subsumption calls : 0
% 0.14/0.48 # Rewrite failures with RHS unbound : 0
% 0.14/0.48 # BW rewrite match attempts : 2
% 0.14/0.48 # BW rewrite match successes : 2
% 0.14/0.48 # Condensation attempts : 0
% 0.14/0.48 # Condensation successes : 0
% 0.14/0.48 # Termbank termtop insertions : 32657
% 0.14/0.48 # Search garbage collected termcells : 700
% 0.14/0.48
% 0.14/0.48 # -------------------------------------------------
% 0.14/0.48 # User time : 0.053 s
% 0.14/0.48 # System time : 0.002 s
% 0.14/0.48 # Total time : 0.055 s
% 0.14/0.48 # Maximum resident set size: 2188 pages
% 0.14/0.48
% 0.14/0.48 # -------------------------------------------------
% 0.14/0.48 # User time : 0.056 s
% 0.14/0.48 # System time : 0.005 s
% 0.14/0.48 # Total time : 0.061 s
% 0.14/0.48 # Maximum resident set size: 1880 pages
% 0.14/0.48 % E---3.1 exiting
% 0.14/0.48 % E exiting
%------------------------------------------------------------------------------