TSTP Solution File: SWC171-1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : SWC171-1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n004.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:39:41 EDT 2023
% Result : Unsatisfiable 0.18s 0.54s
% Output : CNFRefutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 24
% Syntax : Number of clauses : 73 ( 32 unt; 9 nHn; 71 RR)
% Number of literals : 161 ( 44 equ; 86 neg)
% Maximal clause size : 7 ( 2 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 8 con; 0-2 aty)
% Number of variables : 62 ( 4 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(co1_12,negated_conjecture,
~ neq(sk5,sk6),
file('/export/starexec/sandbox/tmp/tmp.E1Tu658ekp/E---3.1_12200.p',co1_12) ).
cnf(clause102,axiom,
( neq(X2,X1)
| X2 = X1
| ~ ssItem(X1)
| ~ ssItem(X2) ),
file('/export/starexec/sandbox/tmp/tmp.E1Tu658ekp/E---3.1_12200.p',clause102) ).
cnf(co1_7,negated_conjecture,
ssItem(sk5),
file('/export/starexec/sandbox/tmp/tmp.E1Tu658ekp/E---3.1_12200.p',co1_7) ).
cnf(co1_8,negated_conjecture,
ssItem(sk6),
file('/export/starexec/sandbox/tmp/tmp.E1Tu658ekp/E---3.1_12200.p',co1_8) ).
cnf(clause143,axiom,
( rearsegP(X3,X2)
| app(X1,X2) != X3
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
file('/export/starexec/sandbox/tmp/tmp.E1Tu658ekp/E---3.1_12200.p',clause143) ).
cnf(clause85,axiom,
( ssList(app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox/tmp/tmp.E1Tu658ekp/E---3.1_12200.p',clause85) ).
cnf(co1_11,negated_conjecture,
app(app(app(sk7,cons(sk5,nil)),cons(sk6,nil)),sk8) = sk1,
file('/export/starexec/sandbox/tmp/tmp.E1Tu658ekp/E---3.1_12200.p',co1_11) ).
cnf(clause149,axiom,
( app(app(X3,X2),X1) = app(X3,app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
file('/export/starexec/sandbox/tmp/tmp.E1Tu658ekp/E---3.1_12200.p',clause149) ).
cnf(co1_10,negated_conjecture,
ssList(sk8),
file('/export/starexec/sandbox/tmp/tmp.E1Tu658ekp/E---3.1_12200.p',co1_10) ).
cnf(clause86,axiom,
( ssList(cons(X1,X2))
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox/tmp/tmp.E1Tu658ekp/E---3.1_12200.p',clause86) ).
cnf(clause8,axiom,
ssList(nil),
file('/export/starexec/sandbox/tmp/tmp.E1Tu658ekp/E---3.1_12200.p',clause8) ).
cnf(co1_9,negated_conjecture,
ssList(sk7),
file('/export/starexec/sandbox/tmp/tmp.E1Tu658ekp/E---3.1_12200.p',co1_9) ).
cnf(clause179,axiom,
( app(app(X1,cons(X2,X3)),cons(X2,X4)) != X5
| ~ ssList(X4)
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssItem(X2)
| ~ duplicatefreeP(X5)
| ~ ssList(X5) ),
file('/export/starexec/sandbox/tmp/tmp.E1Tu658ekp/E---3.1_12200.p',clause179) ).
cnf(clause157,axiom,
( cons(X1,app(X2,X3)) = app(cons(X1,X2),X3)
| ~ ssItem(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
file('/export/starexec/sandbox/tmp/tmp.E1Tu658ekp/E---3.1_12200.p',clause157) ).
cnf(co1_18,negated_conjecture,
( cons(sk9,nil) = sk3
| nil = sk3 ),
file('/export/starexec/sandbox/tmp/tmp.E1Tu658ekp/E---3.1_12200.p',co1_18) ).
cnf(co1_6,negated_conjecture,
sk1 = sk3,
file('/export/starexec/sandbox/tmp/tmp.E1Tu658ekp/E---3.1_12200.p',co1_6) ).
cnf(co1_14,negated_conjecture,
( ssItem(sk9)
| nil = sk3 ),
file('/export/starexec/sandbox/tmp/tmp.E1Tu658ekp/E---3.1_12200.p',co1_14) ).
cnf(co1_1,negated_conjecture,
ssList(sk1),
file('/export/starexec/sandbox/tmp/tmp.E1Tu658ekp/E---3.1_12200.p',co1_1) ).
cnf(clause65,axiom,
( duplicatefreeP(cons(X1,nil))
| ~ ssItem(X1) ),
file('/export/starexec/sandbox/tmp/tmp.E1Tu658ekp/E---3.1_12200.p',clause65) ).
cnf(clause131,axiom,
( app(skaf46(X1,X2),X2) = X1
| ~ rearsegP(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox/tmp/tmp.E1Tu658ekp/E---3.1_12200.p',clause131) ).
cnf(clause119,axiom,
( nil = X2
| app(X1,X2) != nil
| ~ ssList(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox/tmp/tmp.E1Tu658ekp/E---3.1_12200.p',clause119) ).
cnf(clause50,axiom,
ssList(skaf46(X1,X2)),
file('/export/starexec/sandbox/tmp/tmp.E1Tu658ekp/E---3.1_12200.p',clause50) ).
cnf(clause74,axiom,
( app(nil,X1) = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox/tmp/tmp.E1Tu658ekp/E---3.1_12200.p',clause74) ).
cnf(clause2,axiom,
duplicatefreeP(nil),
file('/export/starexec/sandbox/tmp/tmp.E1Tu658ekp/E---3.1_12200.p',clause2) ).
cnf(c_0_24,negated_conjecture,
~ neq(sk5,sk6),
co1_12 ).
cnf(c_0_25,axiom,
( neq(X2,X1)
| X2 = X1
| ~ ssItem(X1)
| ~ ssItem(X2) ),
clause102 ).
cnf(c_0_26,negated_conjecture,
ssItem(sk5),
co1_7 ).
cnf(c_0_27,negated_conjecture,
ssItem(sk6),
co1_8 ).
cnf(c_0_28,axiom,
( rearsegP(X3,X2)
| app(X1,X2) != X3
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
clause143 ).
cnf(c_0_29,axiom,
( ssList(app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2) ),
clause85 ).
cnf(c_0_30,negated_conjecture,
app(app(app(sk7,cons(sk5,nil)),cons(sk6,nil)),sk8) = sk1,
co1_11 ).
cnf(c_0_31,axiom,
( app(app(X3,X2),X1) = app(X3,app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
clause149 ).
cnf(c_0_32,negated_conjecture,
ssList(sk8),
co1_10 ).
cnf(c_0_33,negated_conjecture,
sk6 = sk5,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_26]),c_0_27])]) ).
cnf(c_0_34,plain,
( rearsegP(app(X1,X2),X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(csr,[status(thm)],[inference(er,[status(thm)],[c_0_28]),c_0_29]) ).
cnf(c_0_35,negated_conjecture,
( app(app(sk7,cons(sk5,nil)),app(cons(sk5,nil),sk8)) = sk1
| ~ ssList(app(sk7,cons(sk5,nil)))
| ~ ssList(cons(sk5,nil)) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_32])]),c_0_33]),c_0_33]) ).
cnf(c_0_36,axiom,
( ssList(cons(X1,X2))
| ~ ssItem(X1)
| ~ ssList(X2) ),
clause86 ).
cnf(c_0_37,axiom,
ssList(nil),
clause8 ).
cnf(c_0_38,negated_conjecture,
( rearsegP(sk1,sk8)
| ~ ssList(app(app(sk7,cons(sk5,nil)),cons(sk5,nil))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_30]),c_0_32]),c_0_33])]) ).
cnf(c_0_39,negated_conjecture,
( app(app(sk7,cons(sk5,nil)),app(cons(sk5,nil),sk8)) = sk1
| ~ ssList(app(sk7,cons(sk5,nil))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),c_0_26]),c_0_37])]) ).
cnf(c_0_40,negated_conjecture,
ssList(sk7),
co1_9 ).
cnf(c_0_41,negated_conjecture,
( rearsegP(sk1,sk8)
| ~ ssList(app(sk7,cons(sk5,nil)))
| ~ ssList(cons(sk5,nil)) ),
inference(spm,[status(thm)],[c_0_38,c_0_29]) ).
cnf(c_0_42,negated_conjecture,
( app(app(sk7,cons(sk5,nil)),app(cons(sk5,nil),sk8)) = sk1
| ~ ssList(cons(sk5,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_29]),c_0_40])]) ).
cnf(c_0_43,negated_conjecture,
( rearsegP(sk1,sk8)
| ~ ssList(app(sk7,cons(sk5,nil))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_36]),c_0_26]),c_0_37])]) ).
cnf(c_0_44,axiom,
( app(app(X1,cons(X2,X3)),cons(X2,X4)) != X5
| ~ ssList(X4)
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssItem(X2)
| ~ duplicatefreeP(X5)
| ~ ssList(X5) ),
clause179 ).
cnf(c_0_45,negated_conjecture,
app(app(sk7,cons(sk5,nil)),app(cons(sk5,nil),sk8)) = sk1,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_36]),c_0_26]),c_0_37])]) ).
cnf(c_0_46,axiom,
( cons(X1,app(X2,X3)) = app(cons(X1,X2),X3)
| ~ ssItem(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
clause157 ).
cnf(c_0_47,negated_conjecture,
( cons(sk9,nil) = sk3
| nil = sk3 ),
co1_18 ).
cnf(c_0_48,negated_conjecture,
sk1 = sk3,
co1_6 ).
cnf(c_0_49,negated_conjecture,
( ssItem(sk9)
| nil = sk3 ),
co1_14 ).
cnf(c_0_50,negated_conjecture,
( rearsegP(sk1,sk8)
| ~ ssList(cons(sk5,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_29]),c_0_40])]) ).
cnf(c_0_51,plain,
( ~ ssItem(X1)
| ~ ssList(app(app(X2,cons(X1,X3)),cons(X1,X4)))
| ~ ssList(X4)
| ~ ssList(X3)
| ~ ssList(X2)
| ~ duplicatefreeP(app(app(X2,cons(X1,X3)),cons(X1,X4))) ),
inference(er,[status(thm)],[c_0_44]) ).
cnf(c_0_52,negated_conjecture,
app(app(sk7,cons(sk5,nil)),cons(sk5,app(nil,sk8))) = sk1,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_46]),c_0_26]),c_0_32]),c_0_37])]) ).
cnf(c_0_53,negated_conjecture,
ssList(sk1),
co1_1 ).
cnf(c_0_54,axiom,
( duplicatefreeP(cons(X1,nil))
| ~ ssItem(X1) ),
clause65 ).
cnf(c_0_55,negated_conjecture,
( cons(sk9,nil) = sk1
| nil = sk1 ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_47,c_0_48]),c_0_48]) ).
cnf(c_0_56,negated_conjecture,
( nil = sk1
| ssItem(sk9) ),
inference(rw,[status(thm)],[c_0_49,c_0_48]) ).
cnf(c_0_57,axiom,
( app(skaf46(X1,X2),X2) = X1
| ~ rearsegP(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
clause131 ).
cnf(c_0_58,negated_conjecture,
rearsegP(sk1,sk8),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_36]),c_0_26]),c_0_37])]) ).
cnf(c_0_59,negated_conjecture,
( ~ ssList(app(nil,sk8))
| ~ duplicatefreeP(sk1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_52]),c_0_26]),c_0_53]),c_0_37]),c_0_40])]) ).
cnf(c_0_60,negated_conjecture,
( nil = sk1
| duplicatefreeP(sk1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_55]),c_0_56]) ).
cnf(c_0_61,axiom,
( nil = X2
| app(X1,X2) != nil
| ~ ssList(X2)
| ~ ssList(X1) ),
clause119 ).
cnf(c_0_62,negated_conjecture,
app(skaf46(sk1,sk8),sk8) = sk1,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_57,c_0_58]),c_0_32]),c_0_53])]) ).
cnf(c_0_63,axiom,
ssList(skaf46(X1,X2)),
clause50 ).
cnf(c_0_64,negated_conjecture,
( nil = sk1
| ~ ssList(app(nil,sk8)) ),
inference(spm,[status(thm)],[c_0_59,c_0_60]) ).
cnf(c_0_65,axiom,
( app(nil,X1) = X1
| ~ ssList(X1) ),
clause74 ).
cnf(c_0_66,negated_conjecture,
( sk8 = nil
| nil != sk1 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_61,c_0_62]),c_0_32]),c_0_63])]) ).
cnf(c_0_67,negated_conjecture,
nil = sk1,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_64,c_0_65]),c_0_32])]) ).
cnf(c_0_68,axiom,
duplicatefreeP(nil),
clause2 ).
cnf(c_0_69,negated_conjecture,
sk8 = sk1,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_66,c_0_67]),c_0_67])]) ).
cnf(c_0_70,plain,
duplicatefreeP(sk1),
inference(rw,[status(thm)],[c_0_68,c_0_67]) ).
cnf(c_0_71,negated_conjecture,
~ ssList(app(sk1,sk1)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_59,c_0_67]),c_0_69]),c_0_70])]) ).
cnf(c_0_72,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_71,c_0_29]),c_0_53])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : SWC171-1 : TPTP v8.1.2. Released v2.4.0.
% 0.11/0.13 % Command : run_E %s %d THM
% 0.12/0.33 % Computer : n004.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 2400
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Tue Oct 3 01:37:45 EDT 2023
% 0.12/0.34 % CPUTime :
% 0.18/0.46 Running first-order theorem proving
% 0.18/0.46 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.E1Tu658ekp/E---3.1_12200.p
% 0.18/0.54 # Version: 3.1pre001
% 0.18/0.54 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.18/0.54 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.54 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.18/0.54 # Starting new_bool_3 with 300s (1) cores
% 0.18/0.54 # Starting new_bool_1 with 300s (1) cores
% 0.18/0.54 # Starting sh5l with 300s (1) cores
% 0.18/0.54 # C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 12282 completed with status 0
% 0.18/0.54 # Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.18/0.54 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.18/0.54 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.54 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.18/0.54 # No SInE strategy applied
% 0.18/0.54 # Search class: FGHSM-FSLM21-MFFFFFNN
% 0.18/0.54 # Scheduled 9 strats onto 5 cores with 1500 seconds (1500 total)
% 0.18/0.54 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2s with 406s (1) cores
% 0.18/0.54 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.18/0.54 # Starting G-E--_200_B02_F1_SE_CS_SP_PI_S2k with 136s (1) cores
% 0.18/0.54 # Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S04BN with 136s (1) cores
% 0.18/0.54 # Starting G-E--_200_B02_F1_SE_CS_SP_PI_S0S with 136s (1) cores
% 0.18/0.54 # G-E--_200_B02_F1_SE_CS_SP_PI_S2k with pid 12292 completed with status 0
% 0.18/0.54 # Result found by G-E--_200_B02_F1_SE_CS_SP_PI_S2k
% 0.18/0.54 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.18/0.54 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.54 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.18/0.54 # No SInE strategy applied
% 0.18/0.54 # Search class: FGHSM-FSLM21-MFFFFFNN
% 0.18/0.54 # Scheduled 9 strats onto 5 cores with 1500 seconds (1500 total)
% 0.18/0.54 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2s with 406s (1) cores
% 0.18/0.54 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.18/0.54 # Starting G-E--_200_B02_F1_SE_CS_SP_PI_S2k with 136s (1) cores
% 0.18/0.54 # Preprocessing time : 0.003 s
% 0.18/0.54
% 0.18/0.54 # Proof found!
% 0.18/0.54 # SZS status Unsatisfiable
% 0.18/0.54 # SZS output start CNFRefutation
% See solution above
% 0.18/0.54 # Parsed axioms : 205
% 0.18/0.54 # Removed by relevancy pruning/SinE : 0
% 0.18/0.54 # Initial clauses : 205
% 0.18/0.54 # Removed in clause preprocessing : 0
% 0.18/0.54 # Initial clauses in saturation : 205
% 0.18/0.54 # Processed clauses : 578
% 0.18/0.54 # ...of these trivial : 7
% 0.18/0.54 # ...subsumed : 96
% 0.18/0.54 # ...remaining for further processing : 475
% 0.18/0.54 # Other redundant clauses eliminated : 67
% 0.18/0.54 # Clauses deleted for lack of memory : 0
% 0.18/0.54 # Backward-subsumed : 9
% 0.18/0.54 # Backward-rewritten : 247
% 0.18/0.54 # Generated clauses : 1771
% 0.18/0.54 # ...of the previous two non-redundant : 1728
% 0.18/0.54 # ...aggressively subsumed : 0
% 0.18/0.54 # Contextual simplify-reflections : 50
% 0.18/0.54 # Paramodulations : 1700
% 0.18/0.54 # Factorizations : 0
% 0.18/0.54 # NegExts : 0
% 0.18/0.54 # Equation resolutions : 72
% 0.18/0.54 # Total rewrite steps : 2342
% 0.18/0.54 # Propositional unsat checks : 0
% 0.18/0.54 # Propositional check models : 0
% 0.18/0.54 # Propositional check unsatisfiable : 0
% 0.18/0.54 # Propositional clauses : 0
% 0.18/0.54 # Propositional clauses after purity: 0
% 0.18/0.54 # Propositional unsat core size : 0
% 0.18/0.54 # Propositional preprocessing time : 0.000
% 0.18/0.54 # Propositional encoding time : 0.000
% 0.18/0.54 # Propositional solver time : 0.000
% 0.18/0.54 # Success case prop preproc time : 0.000
% 0.18/0.54 # Success case prop encoding time : 0.000
% 0.18/0.54 # Success case prop solver time : 0.000
% 0.18/0.54 # Current number of processed clauses : 196
% 0.18/0.54 # Positive orientable unit clauses : 69
% 0.18/0.54 # Positive unorientable unit clauses: 0
% 0.18/0.54 # Negative unit clauses : 5
% 0.18/0.54 # Non-unit-clauses : 122
% 0.18/0.54 # Current number of unprocessed clauses: 1346
% 0.18/0.54 # ...number of literals in the above : 6448
% 0.18/0.54 # Current number of archived formulas : 0
% 0.18/0.54 # Current number of archived clauses : 256
% 0.18/0.54 # Clause-clause subsumption calls (NU) : 12105
% 0.18/0.54 # Rec. Clause-clause subsumption calls : 4316
% 0.18/0.54 # Non-unit clause-clause subsumptions : 142
% 0.18/0.54 # Unit Clause-clause subsumption calls : 786
% 0.18/0.54 # Rewrite failures with RHS unbound : 0
% 0.18/0.54 # BW rewrite match attempts : 45
% 0.18/0.54 # BW rewrite match successes : 28
% 0.18/0.54 # Condensation attempts : 0
% 0.18/0.54 # Condensation successes : 0
% 0.18/0.54 # Termbank termtop insertions : 40657
% 0.18/0.54
% 0.18/0.54 # -------------------------------------------------
% 0.18/0.54 # User time : 0.059 s
% 0.18/0.54 # System time : 0.006 s
% 0.18/0.54 # Total time : 0.065 s
% 0.18/0.54 # Maximum resident set size: 2120 pages
% 0.18/0.54
% 0.18/0.54 # -------------------------------------------------
% 0.18/0.54 # User time : 0.274 s
% 0.18/0.54 # System time : 0.029 s
% 0.18/0.54 # Total time : 0.304 s
% 0.18/0.54 # Maximum resident set size: 1856 pages
% 0.18/0.54 % E---3.1 exiting
% 0.18/0.54 % E---3.1 exiting
%------------------------------------------------------------------------------