TSTP Solution File: SWC307-1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : SWC307-1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n008.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:42:29 EDT 2023
% Result : Unsatisfiable 0.15s 0.48s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 27
% Syntax : Number of clauses : 76 ( 42 unt; 4 nHn; 74 RR)
% Number of literals : 158 ( 33 equ; 82 neg)
% Maximal clause size : 9 ( 2 avg)
% Maximal term depth : 6 ( 1 avg)
% Number of predicates : 9 ( 7 usr; 1 prp; 0-2 aty)
% Number of functors : 13 ( 13 usr; 10 con; 0-2 aty)
% Number of variables : 56 ( 2 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(co1_13,negated_conjecture,
app(app(app(app(sk7,cons(sk5,nil)),sk8),cons(sk6,nil)),sk9) = sk1,
file('/export/starexec/sandbox/tmp/tmp.KRdqAUqp1H/E---3.1_10287.p',co1_13) ).
cnf(co1_6,negated_conjecture,
sk1 = sk3,
file('/export/starexec/sandbox/tmp/tmp.KRdqAUqp1H/E---3.1_10287.p',co1_6) ).
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.KRdqAUqp1H/E---3.1_10287.p',clause149) ).
cnf(co1_10,negated_conjecture,
ssList(sk7),
file('/export/starexec/sandbox/tmp/tmp.KRdqAUqp1H/E---3.1_10287.p',co1_10) ).
cnf(co1_11,negated_conjecture,
ssList(sk8),
file('/export/starexec/sandbox/tmp/tmp.KRdqAUqp1H/E---3.1_10287.p',co1_11) ).
cnf(clause86,axiom,
( ssList(cons(X1,X2))
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox/tmp/tmp.KRdqAUqp1H/E---3.1_10287.p',clause86) ).
cnf(co1_8,negated_conjecture,
ssItem(sk5),
file('/export/starexec/sandbox/tmp/tmp.KRdqAUqp1H/E---3.1_10287.p',co1_8) ).
cnf(clause8,axiom,
ssList(nil),
file('/export/starexec/sandbox/tmp/tmp.KRdqAUqp1H/E---3.1_10287.p',clause8) ).
cnf(clause120,axiom,
( app(cons(X1,nil),X2) = cons(X1,X2)
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox/tmp/tmp.KRdqAUqp1H/E---3.1_10287.p',clause120) ).
cnf(co1_12,negated_conjecture,
ssList(sk9),
file('/export/starexec/sandbox/tmp/tmp.KRdqAUqp1H/E---3.1_10287.p',co1_12) ).
cnf(co1_9,negated_conjecture,
ssItem(sk6),
file('/export/starexec/sandbox/tmp/tmp.KRdqAUqp1H/E---3.1_10287.p',co1_9) ).
cnf(clause85,axiom,
( ssList(app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox/tmp/tmp.KRdqAUqp1H/E---3.1_10287.p',clause85) ).
cnf(co1_2,negated_conjecture,
ssList(sk2),
file('/export/starexec/sandbox/tmp/tmp.KRdqAUqp1H/E---3.1_10287.p',co1_2) ).
cnf(co1_5,negated_conjecture,
sk2 = sk4,
file('/export/starexec/sandbox/tmp/tmp.KRdqAUqp1H/E---3.1_10287.p',co1_5) ).
cnf(clause66,axiom,
( strictorderedP(cons(X1,nil))
| ~ ssItem(X1) ),
file('/export/starexec/sandbox/tmp/tmp.KRdqAUqp1H/E---3.1_10287.p',clause66) ).
cnf(clause101,axiom,
( cons(skaf44(X1),nil) = X1
| ~ singletonP(X1)
| ~ ssList(X1) ),
file('/export/starexec/sandbox/tmp/tmp.KRdqAUqp1H/E---3.1_10287.p',clause101) ).
cnf(clause47,axiom,
ssItem(skaf44(X1)),
file('/export/starexec/sandbox/tmp/tmp.KRdqAUqp1H/E---3.1_10287.p',clause47) ).
cnf(co1_15,negated_conjecture,
( singletonP(sk3)
| ~ neq(sk4,nil) ),
file('/export/starexec/sandbox/tmp/tmp.KRdqAUqp1H/E---3.1_10287.p',co1_15) ).
cnf(clause100,axiom,
( neq(X2,X1)
| X2 = X1
| ~ ssList(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox/tmp/tmp.KRdqAUqp1H/E---3.1_10287.p',clause100) ).
cnf(co1_1,negated_conjecture,
ssList(sk1),
file('/export/starexec/sandbox/tmp/tmp.KRdqAUqp1H/E---3.1_10287.p',co1_1) ).
cnf(clause181,axiom,
( lt(X2,X4)
| app(app(X1,cons(X2,X3)),cons(X4,X5)) != X6
| ~ ssList(X5)
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssItem(X4)
| ~ ssItem(X2)
| ~ strictorderedP(X6)
| ~ ssList(X6) ),
file('/export/starexec/sandbox/tmp/tmp.KRdqAUqp1H/E---3.1_10287.p',clause181) ).
cnf(clause114,axiom,
( ~ lt(X1,X2)
| ~ lt(X2,X1)
| ~ ssItem(X1)
| ~ ssItem(X2) ),
file('/export/starexec/sandbox/tmp/tmp.KRdqAUqp1H/E---3.1_10287.p',clause114) ).
cnf(co1_14,negated_conjecture,
lt(sk6,sk5),
file('/export/starexec/sandbox/tmp/tmp.KRdqAUqp1H/E---3.1_10287.p',co1_14) ).
cnf(clause127,axiom,
( X2 = X1
| ~ segmentP(X1,X2)
| ~ segmentP(X2,X1)
| ~ ssList(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox/tmp/tmp.KRdqAUqp1H/E---3.1_10287.p',clause127) ).
cnf(co1_7,negated_conjecture,
segmentP(sk4,sk3),
file('/export/starexec/sandbox/tmp/tmp.KRdqAUqp1H/E---3.1_10287.p',co1_7) ).
cnf(clause56,axiom,
( segmentP(X1,nil)
| ~ ssList(X1) ),
file('/export/starexec/sandbox/tmp/tmp.KRdqAUqp1H/E---3.1_10287.p',clause56) ).
cnf(clause3,axiom,
strictorderedP(nil),
file('/export/starexec/sandbox/tmp/tmp.KRdqAUqp1H/E---3.1_10287.p',clause3) ).
cnf(c_0_27,negated_conjecture,
app(app(app(app(sk7,cons(sk5,nil)),sk8),cons(sk6,nil)),sk9) = sk1,
co1_13 ).
cnf(c_0_28,negated_conjecture,
sk1 = sk3,
co1_6 ).
cnf(c_0_29,negated_conjecture,
app(app(app(app(sk7,cons(sk5,nil)),sk8),cons(sk6,nil)),sk9) = sk3,
inference(rw,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_30,axiom,
( app(app(X3,X2),X1) = app(X3,app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
clause149 ).
cnf(c_0_31,negated_conjecture,
ssList(sk7),
co1_10 ).
cnf(c_0_32,negated_conjecture,
ssList(sk8),
co1_11 ).
cnf(c_0_33,negated_conjecture,
( app(app(app(sk7,app(cons(sk5,nil),sk8)),cons(sk6,nil)),sk9) = sk3
| ~ ssList(cons(sk5,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_34,axiom,
( ssList(cons(X1,X2))
| ~ ssItem(X1)
| ~ ssList(X2) ),
clause86 ).
cnf(c_0_35,negated_conjecture,
ssItem(sk5),
co1_8 ).
cnf(c_0_36,axiom,
ssList(nil),
clause8 ).
cnf(c_0_37,negated_conjecture,
app(app(app(sk7,app(cons(sk5,nil),sk8)),cons(sk6,nil)),sk9) = sk3,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_35]),c_0_36])]) ).
cnf(c_0_38,axiom,
( app(cons(X1,nil),X2) = cons(X1,X2)
| ~ ssItem(X1)
| ~ ssList(X2) ),
clause120 ).
cnf(c_0_39,negated_conjecture,
app(app(app(sk7,cons(sk5,sk8)),cons(sk6,nil)),sk9) = sk3,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_38]),c_0_35]),c_0_32])]) ).
cnf(c_0_40,negated_conjecture,
ssList(sk9),
co1_12 ).
cnf(c_0_41,negated_conjecture,
( app(app(sk7,cons(sk5,sk8)),app(cons(sk6,nil),sk9)) = sk3
| ~ ssList(app(sk7,cons(sk5,sk8)))
| ~ ssList(cons(sk6,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_39]),c_0_40])]) ).
cnf(c_0_42,negated_conjecture,
ssItem(sk6),
co1_9 ).
cnf(c_0_43,negated_conjecture,
( app(app(sk7,cons(sk5,sk8)),app(cons(sk6,nil),sk9)) = sk3
| ~ ssList(app(sk7,cons(sk5,sk8))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_34]),c_0_42]),c_0_36])]) ).
cnf(c_0_44,axiom,
( ssList(app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2) ),
clause85 ).
cnf(c_0_45,negated_conjecture,
ssList(sk2),
co1_2 ).
cnf(c_0_46,negated_conjecture,
sk2 = sk4,
co1_5 ).
cnf(c_0_47,negated_conjecture,
( app(app(sk7,cons(sk5,sk8)),app(cons(sk6,nil),sk9)) = sk3
| ~ ssList(cons(sk5,sk8)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_44]),c_0_31])]) ).
cnf(c_0_48,axiom,
( strictorderedP(cons(X1,nil))
| ~ ssItem(X1) ),
clause66 ).
cnf(c_0_49,axiom,
( cons(skaf44(X1),nil) = X1
| ~ singletonP(X1)
| ~ ssList(X1) ),
clause101 ).
cnf(c_0_50,axiom,
ssItem(skaf44(X1)),
clause47 ).
cnf(c_0_51,negated_conjecture,
( singletonP(sk3)
| ~ neq(sk4,nil) ),
co1_15 ).
cnf(c_0_52,axiom,
( neq(X2,X1)
| X2 = X1
| ~ ssList(X1)
| ~ ssList(X2) ),
clause100 ).
cnf(c_0_53,negated_conjecture,
ssList(sk4),
inference(rw,[status(thm)],[c_0_45,c_0_46]) ).
cnf(c_0_54,negated_conjecture,
ssList(sk1),
co1_1 ).
cnf(c_0_55,axiom,
( lt(X2,X4)
| app(app(X1,cons(X2,X3)),cons(X4,X5)) != X6
| ~ ssList(X5)
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssItem(X4)
| ~ ssItem(X2)
| ~ strictorderedP(X6)
| ~ ssList(X6) ),
clause181 ).
cnf(c_0_56,negated_conjecture,
app(app(sk7,cons(sk5,sk8)),app(cons(sk6,nil),sk9)) = sk3,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_34]),c_0_35]),c_0_32])]) ).
cnf(c_0_57,axiom,
( ~ lt(X1,X2)
| ~ lt(X2,X1)
| ~ ssItem(X1)
| ~ ssItem(X2) ),
clause114 ).
cnf(c_0_58,negated_conjecture,
lt(sk6,sk5),
co1_14 ).
cnf(c_0_59,plain,
( strictorderedP(X1)
| ~ singletonP(X1)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_49]),c_0_50])]) ).
cnf(c_0_60,negated_conjecture,
( sk4 = nil
| singletonP(sk3) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_52]),c_0_53]),c_0_36])]) ).
cnf(c_0_61,negated_conjecture,
ssList(sk3),
inference(rw,[status(thm)],[c_0_54,c_0_28]) ).
cnf(c_0_62,plain,
( lt(X1,X2)
| ~ ssItem(X2)
| ~ ssItem(X1)
| ~ ssList(app(app(X3,cons(X1,X4)),cons(X2,X5)))
| ~ ssList(X5)
| ~ ssList(X4)
| ~ ssList(X3)
| ~ strictorderedP(app(app(X3,cons(X1,X4)),cons(X2,X5))) ),
inference(er,[status(thm)],[c_0_55]) ).
cnf(c_0_63,negated_conjecture,
app(app(sk7,cons(sk5,sk8)),cons(sk6,sk9)) = sk3,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_56,c_0_38]),c_0_42]),c_0_40])]) ).
cnf(c_0_64,negated_conjecture,
~ lt(sk5,sk6),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_57,c_0_58]),c_0_42]),c_0_35])]) ).
cnf(c_0_65,axiom,
( X2 = X1
| ~ segmentP(X1,X2)
| ~ segmentP(X2,X1)
| ~ ssList(X1)
| ~ ssList(X2) ),
clause127 ).
cnf(c_0_66,negated_conjecture,
segmentP(sk4,sk3),
co1_7 ).
cnf(c_0_67,negated_conjecture,
( sk4 = nil
| strictorderedP(sk3) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_59,c_0_60]),c_0_61])]) ).
cnf(c_0_68,negated_conjecture,
~ strictorderedP(sk3),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_62,c_0_63]),c_0_42]),c_0_35]),c_0_61]),c_0_40]),c_0_32]),c_0_31])]),c_0_64]) ).
cnf(c_0_69,negated_conjecture,
( sk3 = sk4
| ~ segmentP(sk3,sk4) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_65,c_0_66]),c_0_53]),c_0_61])]) ).
cnf(c_0_70,negated_conjecture,
sk4 = nil,
inference(sr,[status(thm)],[c_0_67,c_0_68]) ).
cnf(c_0_71,negated_conjecture,
( sk3 = nil
| ~ segmentP(sk3,nil) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_69,c_0_70]),c_0_70]) ).
cnf(c_0_72,axiom,
( segmentP(X1,nil)
| ~ ssList(X1) ),
clause56 ).
cnf(c_0_73,negated_conjecture,
sk3 = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_71,c_0_72]),c_0_61])]) ).
cnf(c_0_74,axiom,
strictorderedP(nil),
clause3 ).
cnf(c_0_75,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_68,c_0_73]),c_0_74])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.09 % Problem : SWC307-1 : TPTP v8.1.2. Released v2.4.0.
% 0.05/0.10 % Command : run_E %s %d THM
% 0.10/0.30 % Computer : n008.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 : 2400
% 0.10/0.30 % WCLimit : 300
% 0.10/0.30 % DateTime : Tue Oct 3 01:53:43 EDT 2023
% 0.10/0.30 % CPUTime :
% 0.15/0.41 Running first-order model finding
% 0.15/0.41 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/tmp/tmp.KRdqAUqp1H/E---3.1_10287.p
% 0.15/0.48 # Version: 3.1pre001
% 0.15/0.48 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.15/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.48 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.15/0.48 # Starting new_bool_3 with 300s (1) cores
% 0.15/0.48 # Starting new_bool_1 with 300s (1) cores
% 0.15/0.48 # Starting sh5l with 300s (1) cores
% 0.15/0.48 # C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 10364 completed with status 0
% 0.15/0.48 # Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.15/0.48 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.15/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.48 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.15/0.48 # No SInE strategy applied
% 0.15/0.48 # Search class: FGHSM-FSLM21-MFFFFFNN
% 0.15/0.48 # Scheduled 9 strats onto 5 cores with 1500 seconds (1500 total)
% 0.15/0.48 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2s with 406s (1) cores
% 0.15/0.48 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.15/0.48 # Starting G-E--_200_B02_F1_SE_CS_SP_PI_S2k with 136s (1) cores
% 0.15/0.48 # Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S04BN with 136s (1) cores
% 0.15/0.48 # Starting G-E--_200_B02_F1_SE_CS_SP_PI_S0S with 136s (1) cores
% 0.15/0.48 # G-E--_208_C18_F1_SE_CS_SP_PS_S2s with pid 10370 completed with status 0
% 0.15/0.48 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S2s
% 0.15/0.48 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.15/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.48 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.15/0.48 # No SInE strategy applied
% 0.15/0.48 # Search class: FGHSM-FSLM21-MFFFFFNN
% 0.15/0.48 # Scheduled 9 strats onto 5 cores with 1500 seconds (1500 total)
% 0.15/0.48 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2s with 406s (1) cores
% 0.15/0.48 # Preprocessing time : 0.003 s
% 0.15/0.48 # Presaturation interreduction done
% 0.15/0.48
% 0.15/0.48 # Proof found!
% 0.15/0.48 # SZS status Unsatisfiable
% 0.15/0.48 # SZS output start CNFRefutation
% See solution above
% 0.15/0.48 # Parsed axioms : 200
% 0.15/0.48 # Removed by relevancy pruning/SinE : 0
% 0.15/0.48 # Initial clauses : 200
% 0.15/0.48 # Removed in clause preprocessing : 0
% 0.15/0.48 # Initial clauses in saturation : 200
% 0.15/0.48 # Processed clauses : 694
% 0.15/0.48 # ...of these trivial : 6
% 0.15/0.48 # ...subsumed : 123
% 0.15/0.48 # ...remaining for further processing : 565
% 0.15/0.48 # Other redundant clauses eliminated : 72
% 0.15/0.48 # Clauses deleted for lack of memory : 0
% 0.15/0.48 # Backward-subsumed : 12
% 0.15/0.48 # Backward-rewritten : 100
% 0.15/0.48 # Generated clauses : 1239
% 0.15/0.48 # ...of the previous two non-redundant : 1071
% 0.15/0.48 # ...aggressively subsumed : 0
% 0.15/0.48 # Contextual simplify-reflections : 15
% 0.15/0.48 # Paramodulations : 1162
% 0.15/0.48 # Factorizations : 0
% 0.15/0.48 # NegExts : 0
% 0.15/0.48 # Equation resolutions : 77
% 0.15/0.48 # Total rewrite steps : 1384
% 0.15/0.48 # Propositional unsat checks : 0
% 0.15/0.48 # Propositional check models : 0
% 0.15/0.48 # Propositional check unsatisfiable : 0
% 0.15/0.48 # Propositional clauses : 0
% 0.15/0.48 # Propositional clauses after purity: 0
% 0.15/0.48 # Propositional unsat core size : 0
% 0.15/0.48 # Propositional preprocessing time : 0.000
% 0.15/0.48 # Propositional encoding time : 0.000
% 0.15/0.48 # Propositional solver time : 0.000
% 0.15/0.48 # Success case prop preproc time : 0.000
% 0.15/0.48 # Success case prop encoding time : 0.000
% 0.15/0.48 # Success case prop solver time : 0.000
% 0.15/0.48 # Current number of processed clauses : 237
% 0.15/0.48 # Positive orientable unit clauses : 70
% 0.15/0.48 # Positive unorientable unit clauses: 0
% 0.15/0.48 # Negative unit clauses : 4
% 0.15/0.48 # Non-unit-clauses : 163
% 0.15/0.48 # Current number of unprocessed clauses: 760
% 0.15/0.48 # ...number of literals in the above : 3980
% 0.15/0.48 # Current number of archived formulas : 0
% 0.15/0.48 # Current number of archived clauses : 305
% 0.15/0.48 # Clause-clause subsumption calls (NU) : 17146
% 0.15/0.48 # Rec. Clause-clause subsumption calls : 4161
% 0.15/0.48 # Non-unit clause-clause subsumptions : 134
% 0.15/0.48 # Unit Clause-clause subsumption calls : 583
% 0.15/0.48 # Rewrite failures with RHS unbound : 0
% 0.15/0.48 # BW rewrite match attempts : 37
% 0.15/0.48 # BW rewrite match successes : 18
% 0.15/0.48 # Condensation attempts : 0
% 0.15/0.48 # Condensation successes : 0
% 0.15/0.48 # Termbank termtop insertions : 32415
% 0.15/0.48
% 0.15/0.48 # -------------------------------------------------
% 0.15/0.48 # User time : 0.055 s
% 0.15/0.48 # System time : 0.004 s
% 0.15/0.48 # Total time : 0.059 s
% 0.15/0.48 # Maximum resident set size: 2112 pages
% 0.15/0.48
% 0.15/0.48 # -------------------------------------------------
% 0.15/0.48 # User time : 0.266 s
% 0.15/0.48 # System time : 0.026 s
% 0.15/0.48 # Total time : 0.291 s
% 0.15/0.48 # Maximum resident set size: 1852 pages
% 0.15/0.48 % E---3.1 exiting
%------------------------------------------------------------------------------