TSTP Solution File: SWC314-1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : SWC314-1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n017.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:40:23 EDT 2023
% Result : Unsatisfiable 0.16s 0.47s
% Output : CNFRefutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 24
% Syntax : Number of clauses : 79 ( 21 unt; 16 nHn; 79 RR)
% Number of literals : 209 ( 94 equ; 119 neg)
% Maximal clause size : 12 ( 2 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 7 con; 0-2 aty)
% Number of variables : 54 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(co1_7,negated_conjecture,
( nil = sk3
| nil != sk4 ),
file('/export/starexec/sandbox2/tmp/tmp.wXZ7Gu2FxF/E---3.1_14099.p',co1_7) ).
cnf(co1_6,negated_conjecture,
sk1 = sk3,
file('/export/starexec/sandbox2/tmp/tmp.wXZ7Gu2FxF/E---3.1_14099.p',co1_6) ).
cnf(co1_5,negated_conjecture,
sk2 = sk4,
file('/export/starexec/sandbox2/tmp/tmp.wXZ7Gu2FxF/E---3.1_14099.p',co1_5) ).
cnf(clause119,axiom,
( nil = X2
| app(X1,X2) != nil
| ~ ssList(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.wXZ7Gu2FxF/E---3.1_14099.p',clause119) ).
cnf(co1_15,negated_conjecture,
( app(cons(sk5,nil),sk6) = sk2
| nil != sk1 ),
file('/export/starexec/sandbox2/tmp/tmp.wXZ7Gu2FxF/E---3.1_14099.p',co1_15) ).
cnf(co1_14,negated_conjecture,
( ssList(sk6)
| nil != sk1 ),
file('/export/starexec/sandbox2/tmp/tmp.wXZ7Gu2FxF/E---3.1_14099.p',co1_14) ).
cnf(clause86,axiom,
( ssList(cons(X1,X2))
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox2/tmp/tmp.wXZ7Gu2FxF/E---3.1_14099.p',clause86) ).
cnf(clause8,axiom,
ssList(nil),
file('/export/starexec/sandbox2/tmp/tmp.wXZ7Gu2FxF/E---3.1_14099.p',clause8) ).
cnf(co1_10,negated_conjecture,
( ssItem(sk5)
| nil != sk1 ),
file('/export/starexec/sandbox2/tmp/tmp.wXZ7Gu2FxF/E---3.1_14099.p',co1_10) ).
cnf(clause118,axiom,
( nil = X1
| app(X1,X2) != nil
| ~ ssList(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.wXZ7Gu2FxF/E---3.1_14099.p',clause118) ).
cnf(clause99,axiom,
( cons(X1,X2) != X2
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox2/tmp/tmp.wXZ7Gu2FxF/E---3.1_14099.p',clause99) ).
cnf(co1_8,negated_conjecture,
( sk3 = X1
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3)
| tl(sk4) != X2
| app(X2,X3) != X1
| ~ ssItem(X4)
| cons(X4,nil) != X3
| hd(sk4) != X4
| ~ neq(nil,sk4)
| ~ neq(nil,sk4)
| ~ neq(sk4,nil) ),
file('/export/starexec/sandbox2/tmp/tmp.wXZ7Gu2FxF/E---3.1_14099.p',co1_8) ).
cnf(clause76,axiom,
( ssItem(hd(X1))
| nil = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.wXZ7Gu2FxF/E---3.1_14099.p',clause76) ).
cnf(co1_2,negated_conjecture,
ssList(sk2),
file('/export/starexec/sandbox2/tmp/tmp.wXZ7Gu2FxF/E---3.1_14099.p',co1_2) ).
cnf(clause75,axiom,
( ssList(tl(X1))
| nil = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.wXZ7Gu2FxF/E---3.1_14099.p',clause75) ).
cnf(co1_12,negated_conjecture,
( app(cons(sk5,nil),sk6) = sk2
| nil = sk2 ),
file('/export/starexec/sandbox2/tmp/tmp.wXZ7Gu2FxF/E---3.1_14099.p',co1_12) ).
cnf(co1_9,negated_conjecture,
( ssItem(sk5)
| nil = sk2 ),
file('/export/starexec/sandbox2/tmp/tmp.wXZ7Gu2FxF/E---3.1_14099.p',co1_9) ).
cnf(co1_11,negated_conjecture,
( ssList(sk6)
| nil = sk2 ),
file('/export/starexec/sandbox2/tmp/tmp.wXZ7Gu2FxF/E---3.1_14099.p',co1_11) ).
cnf(clause85,axiom,
( ssList(app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox2/tmp/tmp.wXZ7Gu2FxF/E---3.1_14099.p',clause85) ).
cnf(clause120,axiom,
( app(cons(X1,nil),X2) = cons(X1,X2)
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox2/tmp/tmp.wXZ7Gu2FxF/E---3.1_14099.p',clause120) ).
cnf(clause96,axiom,
( tl(cons(X1,X2)) = X2
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox2/tmp/tmp.wXZ7Gu2FxF/E---3.1_14099.p',clause96) ).
cnf(clause97,axiom,
( hd(cons(X1,X2)) = X1
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox2/tmp/tmp.wXZ7Gu2FxF/E---3.1_14099.p',clause97) ).
cnf(clause100,axiom,
( neq(X2,X1)
| X2 = X1
| ~ ssList(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox2/tmp/tmp.wXZ7Gu2FxF/E---3.1_14099.p',clause100) ).
cnf(co1_13,negated_conjecture,
( nil = sk2
| app(sk6,cons(sk5,nil)) != sk1 ),
file('/export/starexec/sandbox2/tmp/tmp.wXZ7Gu2FxF/E---3.1_14099.p',co1_13) ).
cnf(c_0_24,negated_conjecture,
( nil = sk3
| nil != sk4 ),
co1_7 ).
cnf(c_0_25,negated_conjecture,
sk1 = sk3,
co1_6 ).
cnf(c_0_26,negated_conjecture,
sk2 = sk4,
co1_5 ).
cnf(c_0_27,axiom,
( nil = X2
| app(X1,X2) != nil
| ~ ssList(X2)
| ~ ssList(X1) ),
clause119 ).
cnf(c_0_28,negated_conjecture,
( app(cons(sk5,nil),sk6) = sk2
| nil != sk1 ),
co1_15 ).
cnf(c_0_29,negated_conjecture,
( ssList(sk6)
| nil != sk1 ),
co1_14 ).
cnf(c_0_30,negated_conjecture,
( sk1 = nil
| sk2 != nil ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_24,c_0_25]),c_0_26]) ).
cnf(c_0_31,negated_conjecture,
( sk6 = nil
| sk2 != nil
| ~ ssList(cons(sk5,nil)) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_29]),c_0_30]) ).
cnf(c_0_32,axiom,
( ssList(cons(X1,X2))
| ~ ssItem(X1)
| ~ ssList(X2) ),
clause86 ).
cnf(c_0_33,axiom,
ssList(nil),
clause8 ).
cnf(c_0_34,negated_conjecture,
( sk6 = nil
| sk2 != nil
| ~ ssItem(sk5) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_33])]) ).
cnf(c_0_35,negated_conjecture,
( ssItem(sk5)
| nil != sk1 ),
co1_10 ).
cnf(c_0_36,negated_conjecture,
( sk6 = nil
| sk2 != nil ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_30]) ).
cnf(c_0_37,axiom,
( nil = X1
| app(X1,X2) != nil
| ~ ssList(X2)
| ~ ssList(X1) ),
clause118 ).
cnf(c_0_38,negated_conjecture,
( app(cons(sk5,nil),nil) = sk2
| sk2 != nil ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_36]),c_0_30]) ).
cnf(c_0_39,negated_conjecture,
( cons(sk5,nil) = nil
| sk2 != nil
| ~ ssList(cons(sk5,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_38]),c_0_33])]) ).
cnf(c_0_40,axiom,
( cons(X1,X2) != X2
| ~ ssItem(X1)
| ~ ssList(X2) ),
clause99 ).
cnf(c_0_41,negated_conjecture,
( cons(sk5,nil) = nil
| sk2 != nil
| ~ ssItem(sk5) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_32]),c_0_33])]) ).
cnf(c_0_42,negated_conjecture,
( sk2 != nil
| ~ ssItem(sk5) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_41]),c_0_33])]) ).
cnf(c_0_43,negated_conjecture,
( sk3 = X1
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3)
| tl(sk4) != X2
| app(X2,X3) != X1
| ~ ssItem(X4)
| cons(X4,nil) != X3
| hd(sk4) != X4
| ~ neq(nil,sk4)
| ~ neq(nil,sk4)
| ~ neq(sk4,nil) ),
co1_8 ).
cnf(c_0_44,axiom,
( ssItem(hd(X1))
| nil = X1
| ~ ssList(X1) ),
clause76 ).
cnf(c_0_45,negated_conjecture,
ssList(sk2),
co1_2 ).
cnf(c_0_46,axiom,
( ssList(tl(X1))
| nil = X1
| ~ ssList(X1) ),
clause75 ).
cnf(c_0_47,negated_conjecture,
( app(cons(sk5,nil),sk6) = sk2
| nil = sk2 ),
co1_12 ).
cnf(c_0_48,negated_conjecture,
sk2 != nil,
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_35]),c_0_30]) ).
cnf(c_0_49,negated_conjecture,
( ssItem(sk5)
| nil = sk2 ),
co1_9 ).
cnf(c_0_50,negated_conjecture,
( ssList(sk6)
| nil = sk2 ),
co1_11 ).
cnf(c_0_51,negated_conjecture,
( sk3 = X1
| tl(sk4) != X2
| hd(sk4) != X4
| app(X2,X3) != X1
| cons(X4,nil) != X3
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssItem(X4)
| ~ neq(nil,sk4)
| ~ neq(sk4,nil) ),
inference(cn,[status(thm)],[c_0_43]) ).
cnf(c_0_52,axiom,
( ssList(app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2) ),
clause85 ).
cnf(c_0_53,negated_conjecture,
( sk2 = nil
| ssItem(hd(sk2)) ),
inference(spm,[status(thm)],[c_0_44,c_0_45]) ).
cnf(c_0_54,negated_conjecture,
( sk2 = nil
| ssList(tl(sk2)) ),
inference(spm,[status(thm)],[c_0_46,c_0_45]) ).
cnf(c_0_55,axiom,
( app(cons(X1,nil),X2) = cons(X1,X2)
| ~ ssItem(X1)
| ~ ssList(X2) ),
clause120 ).
cnf(c_0_56,negated_conjecture,
app(cons(sk5,nil),sk6) = sk2,
inference(sr,[status(thm)],[c_0_47,c_0_48]) ).
cnf(c_0_57,negated_conjecture,
ssItem(sk5),
inference(sr,[status(thm)],[c_0_49,c_0_48]) ).
cnf(c_0_58,negated_conjecture,
ssList(sk6),
inference(sr,[status(thm)],[c_0_50,c_0_48]) ).
cnf(c_0_59,negated_conjecture,
( app(tl(sk2),cons(hd(sk2),nil)) = sk1
| ~ neq(nil,sk2)
| ~ neq(sk2,nil)
| ~ ssItem(hd(sk2))
| ~ ssList(cons(hd(sk2),nil))
| ~ ssList(tl(sk2)) ),
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_51,c_0_25]),c_0_26]),c_0_26]),c_0_26]),c_0_26])])])])]),c_0_52]) ).
cnf(c_0_60,negated_conjecture,
ssItem(hd(sk2)),
inference(sr,[status(thm)],[c_0_53,c_0_48]) ).
cnf(c_0_61,negated_conjecture,
ssList(tl(sk2)),
inference(sr,[status(thm)],[c_0_54,c_0_48]) ).
cnf(c_0_62,axiom,
( tl(cons(X1,X2)) = X2
| ~ ssItem(X1)
| ~ ssList(X2) ),
clause96 ).
cnf(c_0_63,negated_conjecture,
cons(sk5,sk6) = sk2,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_55,c_0_56]),c_0_57]),c_0_58])]) ).
cnf(c_0_64,axiom,
( hd(cons(X1,X2)) = X1
| ~ ssItem(X1)
| ~ ssList(X2) ),
clause97 ).
cnf(c_0_65,axiom,
( neq(X2,X1)
| X2 = X1
| ~ ssList(X1)
| ~ ssList(X2) ),
clause100 ).
cnf(c_0_66,negated_conjecture,
( app(tl(sk2),cons(hd(sk2),nil)) = sk1
| ~ neq(nil,sk2)
| ~ neq(sk2,nil)
| ~ ssList(cons(hd(sk2),nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_59,c_0_60]),c_0_61])]) ).
cnf(c_0_67,negated_conjecture,
tl(sk2) = sk6,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_62,c_0_63]),c_0_57]),c_0_58])]) ).
cnf(c_0_68,negated_conjecture,
hd(sk2) = sk5,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_64,c_0_63]),c_0_57]),c_0_58])]) ).
cnf(c_0_69,negated_conjecture,
( X1 = sk2
| neq(sk2,X1)
| ~ ssList(X1) ),
inference(spm,[status(thm)],[c_0_65,c_0_45]) ).
cnf(c_0_70,negated_conjecture,
( app(sk6,cons(sk5,nil)) = sk1
| ~ neq(nil,sk2)
| ~ neq(sk2,nil)
| ~ ssList(cons(sk5,nil)) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_66,c_0_67]),c_0_68]),c_0_68]) ).
cnf(c_0_71,negated_conjecture,
neq(sk2,nil),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_69,c_0_33]),c_0_48]) ).
cnf(c_0_72,plain,
( X1 = nil
| neq(nil,X1)
| ~ ssList(X1) ),
inference(spm,[status(thm)],[c_0_65,c_0_33]) ).
cnf(c_0_73,negated_conjecture,
( app(sk6,cons(sk5,nil)) = sk1
| ~ neq(nil,sk2)
| ~ ssList(cons(sk5,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_70,c_0_71])]) ).
cnf(c_0_74,negated_conjecture,
neq(nil,sk2),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_72,c_0_45]),c_0_48]) ).
cnf(c_0_75,negated_conjecture,
( nil = sk2
| app(sk6,cons(sk5,nil)) != sk1 ),
co1_13 ).
cnf(c_0_76,negated_conjecture,
( app(sk6,cons(sk5,nil)) = sk1
| ~ ssList(cons(sk5,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_73,c_0_74])]) ).
cnf(c_0_77,negated_conjecture,
~ ssList(cons(sk5,nil)),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_75,c_0_76]),c_0_48]) ).
cnf(c_0_78,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_77,c_0_32]),c_0_57]),c_0_33])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.11 % Problem : SWC314-1 : TPTP v8.1.2. Released v2.4.0.
% 0.02/0.12 % Command : run_E %s %d THM
% 0.11/0.32 % Computer : n017.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 2400
% 0.11/0.32 % WCLimit : 300
% 0.11/0.32 % DateTime : Tue Oct 3 01:27:56 EDT 2023
% 0.11/0.32 % CPUTime :
% 0.16/0.43 Running first-order theorem proving
% 0.16/0.43 Running: /export/starexec/sandbox2/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/sandbox2/tmp/tmp.wXZ7Gu2FxF/E---3.1_14099.p
% 0.16/0.47 # Version: 3.1pre001
% 0.16/0.47 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.16/0.47 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.47 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.16/0.47 # Starting new_bool_3 with 300s (1) cores
% 0.16/0.47 # Starting new_bool_1 with 300s (1) cores
% 0.16/0.47 # Starting sh5l with 300s (1) cores
% 0.16/0.47 # new_bool_1 with pid 14179 completed with status 0
% 0.16/0.47 # Result found by new_bool_1
% 0.16/0.47 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.16/0.47 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.47 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.16/0.47 # Starting new_bool_3 with 300s (1) cores
% 0.16/0.47 # Starting new_bool_1 with 300s (1) cores
% 0.16/0.47 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.16/0.47 # Search class: FGHSF-FFMM21-MFFFFFNN
% 0.16/0.47 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.16/0.47 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 0.16/0.47 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 14181 completed with status 0
% 0.16/0.47 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.16/0.47 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.16/0.47 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.47 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.16/0.47 # Starting new_bool_3 with 300s (1) cores
% 0.16/0.47 # Starting new_bool_1 with 300s (1) cores
% 0.16/0.47 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.16/0.47 # Search class: FGHSF-FFMM21-MFFFFFNN
% 0.16/0.47 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.16/0.47 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 0.16/0.47 # Preprocessing time : 0.003 s
% 0.16/0.47 # Presaturation interreduction done
% 0.16/0.47
% 0.16/0.47 # Proof found!
% 0.16/0.47 # SZS status Unsatisfiable
% 0.16/0.47 # SZS output start CNFRefutation
% See solution above
% 0.16/0.47 # Parsed axioms : 201
% 0.16/0.47 # Removed by relevancy pruning/SinE : 129
% 0.16/0.47 # Initial clauses : 72
% 0.16/0.47 # Removed in clause preprocessing : 0
% 0.16/0.47 # Initial clauses in saturation : 72
% 0.16/0.47 # Processed clauses : 239
% 0.16/0.47 # ...of these trivial : 3
% 0.16/0.47 # ...subsumed : 21
% 0.16/0.47 # ...remaining for further processing : 215
% 0.16/0.47 # Other redundant clauses eliminated : 17
% 0.16/0.47 # Clauses deleted for lack of memory : 0
% 0.16/0.47 # Backward-subsumed : 24
% 0.16/0.47 # Backward-rewritten : 8
% 0.16/0.47 # Generated clauses : 448
% 0.16/0.47 # ...of the previous two non-redundant : 392
% 0.16/0.47 # ...aggressively subsumed : 0
% 0.16/0.47 # Contextual simplify-reflections : 12
% 0.16/0.47 # Paramodulations : 424
% 0.16/0.47 # Factorizations : 0
% 0.16/0.47 # NegExts : 0
% 0.16/0.47 # Equation resolutions : 21
% 0.16/0.47 # Total rewrite steps : 278
% 0.16/0.47 # Propositional unsat checks : 0
% 0.16/0.47 # Propositional check models : 0
% 0.16/0.47 # Propositional check unsatisfiable : 0
% 0.16/0.47 # Propositional clauses : 0
% 0.16/0.47 # Propositional clauses after purity: 0
% 0.16/0.47 # Propositional unsat core size : 0
% 0.16/0.47 # Propositional preprocessing time : 0.000
% 0.16/0.47 # Propositional encoding time : 0.000
% 0.16/0.47 # Propositional solver time : 0.000
% 0.16/0.47 # Success case prop preproc time : 0.000
% 0.16/0.47 # Success case prop encoding time : 0.000
% 0.16/0.47 # Success case prop solver time : 0.000
% 0.16/0.47 # Current number of processed clauses : 103
% 0.16/0.47 # Positive orientable unit clauses : 19
% 0.16/0.47 # Positive unorientable unit clauses: 0
% 0.16/0.47 # Negative unit clauses : 3
% 0.16/0.47 # Non-unit-clauses : 81
% 0.16/0.47 # Current number of unprocessed clauses: 274
% 0.16/0.47 # ...number of literals in the above : 1401
% 0.16/0.47 # Current number of archived formulas : 0
% 0.16/0.47 # Current number of archived clauses : 103
% 0.16/0.47 # Clause-clause subsumption calls (NU) : 2491
% 0.16/0.47 # Rec. Clause-clause subsumption calls : 588
% 0.16/0.47 # Non-unit clause-clause subsumptions : 31
% 0.16/0.47 # Unit Clause-clause subsumption calls : 130
% 0.16/0.47 # Rewrite failures with RHS unbound : 0
% 0.16/0.47 # BW rewrite match attempts : 9
% 0.16/0.47 # BW rewrite match successes : 9
% 0.16/0.47 # Condensation attempts : 0
% 0.16/0.47 # Condensation successes : 0
% 0.16/0.47 # Termbank termtop insertions : 10286
% 0.16/0.47
% 0.16/0.47 # -------------------------------------------------
% 0.16/0.47 # User time : 0.016 s
% 0.16/0.47 # System time : 0.005 s
% 0.16/0.47 # Total time : 0.021 s
% 0.16/0.47 # Maximum resident set size: 1972 pages
% 0.16/0.47
% 0.16/0.47 # -------------------------------------------------
% 0.16/0.47 # User time : 0.021 s
% 0.16/0.47 # System time : 0.005 s
% 0.16/0.47 # Total time : 0.026 s
% 0.16/0.47 # Maximum resident set size: 1856 pages
% 0.16/0.47 % E---3.1 exiting
% 0.16/0.47 % E---3.1 exiting
%------------------------------------------------------------------------------