TSTP Solution File: SWC315-1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SWC315-1 : TPTP v8.2.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n027.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:25:34 EDT 2024
% Result : Unsatisfiable 0.21s 0.51s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 22
% Syntax : Number of clauses : 92 ( 21 unt; 14 nHn; 92 RR)
% Number of literals : 207 ( 98 equ; 106 neg)
% Maximal clause size : 6 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 9 con; 0-2 aty)
% Number of variables : 51 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(co1_14,negated_conjecture,
( app(cons(sk5,nil),sk6) = sk2
| nil != sk1 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_14) ).
cnf(co1_5,negated_conjecture,
sk2 = sk4,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_5) ).
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(co1_13,negated_conjecture,
( ssList(sk6)
| nil != sk1 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_13) ).
cnf(co1_9,negated_conjecture,
( ssItem(sk5)
| nil != sk1 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_9) ).
cnf(co1_7,negated_conjecture,
( nil = sk3
| nil != sk4 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_7) ).
cnf(co1_16,negated_conjecture,
( ssItem(sk7)
| ~ neq(sk4,nil) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_16) ).
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(clause98,axiom,
( cons(X1,X2) != nil
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause98) ).
cnf(co1_6,negated_conjecture,
sk1 = sk3,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_6) ).
cnf(co1_17,negated_conjecture,
( ssList(sk8)
| ~ neq(sk4,nil) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_17) ).
cnf(clause8,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause8) ).
cnf(co1_8,negated_conjecture,
( ssItem(sk5)
| nil = sk2 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_8) ).
cnf(co1_18,negated_conjecture,
( app(cons(sk7,nil),sk8) = sk4
| ~ neq(sk4,nil) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_18) ).
cnf(clause171,axiom,
( X4 = X2
| cons(X1,X2) != cons(X3,X4)
| ~ ssItem(X3)
| ~ ssItem(X1)
| ~ ssList(X4)
| ~ ssList(X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause171) ).
cnf(co1_11,negated_conjecture,
( app(cons(sk5,nil),sk6) = sk2
| nil = sk2 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_11) ).
cnf(co1_10,negated_conjecture,
( ssList(sk6)
| nil = sk2 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_10) ).
cnf(clause151,axiom,
( X1 = X3
| app(X1,X2) != app(X3,X2)
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause151) ).
cnf(clause86,axiom,
( ssList(cons(X1,X2))
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause86) ).
cnf(co1_19,negated_conjecture,
( app(sk8,cons(sk7,nil)) = sk3
| ~ neq(sk4,nil) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_19) ).
cnf(co1_12,negated_conjecture,
( nil = sk2
| app(sk6,cons(sk5,nil)) != sk1 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_12) ).
cnf(c_0_22,negated_conjecture,
( app(cons(sk5,nil),sk6) = sk2
| nil != sk1 ),
inference(fof_simplification,[status(thm)],[co1_14]) ).
cnf(c_0_23,negated_conjecture,
( app(cons(sk5,nil),sk6) = sk2
| nil != sk1 ),
c_0_22 ).
cnf(c_0_24,negated_conjecture,
sk2 = sk4,
co1_5 ).
cnf(c_0_25,plain,
( app(cons(X1,nil),X2) = cons(X1,X2)
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(fof_simplification,[status(thm)],[clause120]) ).
cnf(c_0_26,negated_conjecture,
( ssList(sk6)
| nil != sk1 ),
inference(fof_simplification,[status(thm)],[co1_13]) ).
cnf(c_0_27,negated_conjecture,
( ssItem(sk5)
| nil != sk1 ),
inference(fof_simplification,[status(thm)],[co1_9]) ).
cnf(c_0_28,negated_conjecture,
( nil = sk3
| nil != sk4 ),
inference(fof_simplification,[status(thm)],[co1_7]) ).
cnf(c_0_29,negated_conjecture,
( ssItem(sk7)
| ~ neq(sk4,nil) ),
inference(fof_simplification,[status(thm)],[co1_16]) ).
cnf(c_0_30,plain,
( neq(X2,X1)
| X2 = X1
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(fof_simplification,[status(thm)],[clause100]) ).
cnf(c_0_31,negated_conjecture,
ssList(sk2),
co1_2 ).
cnf(c_0_32,plain,
( cons(X1,X2) != nil
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(fof_simplification,[status(thm)],[clause98]) ).
cnf(c_0_33,negated_conjecture,
( app(cons(sk5,nil),sk6) = sk4
| sk1 != nil ),
inference(rw,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_34,plain,
( app(cons(X1,nil),X2) = cons(X1,X2)
| ~ ssItem(X1)
| ~ ssList(X2) ),
c_0_25 ).
cnf(c_0_35,negated_conjecture,
( ssList(sk6)
| nil != sk1 ),
c_0_26 ).
cnf(c_0_36,negated_conjecture,
( ssItem(sk5)
| nil != sk1 ),
c_0_27 ).
cnf(c_0_37,negated_conjecture,
( nil = sk3
| nil != sk4 ),
c_0_28 ).
cnf(c_0_38,negated_conjecture,
sk1 = sk3,
co1_6 ).
cnf(c_0_39,negated_conjecture,
( ssList(sk8)
| ~ neq(sk4,nil) ),
inference(fof_simplification,[status(thm)],[co1_17]) ).
cnf(c_0_40,negated_conjecture,
( ssItem(sk7)
| ~ neq(sk4,nil) ),
c_0_29 ).
cnf(c_0_41,plain,
( neq(X2,X1)
| X2 = X1
| ~ ssList(X1)
| ~ ssList(X2) ),
c_0_30 ).
cnf(c_0_42,negated_conjecture,
ssList(sk4),
inference(rw,[status(thm)],[c_0_31,c_0_24]) ).
cnf(c_0_43,axiom,
ssList(nil),
clause8 ).
cnf(c_0_44,plain,
( cons(X1,X2) != nil
| ~ ssItem(X1)
| ~ ssList(X2) ),
c_0_32 ).
cnf(c_0_45,negated_conjecture,
( cons(sk5,sk6) = sk4
| sk1 != nil ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_35]),c_0_36]) ).
cnf(c_0_46,negated_conjecture,
( sk1 = nil
| sk4 != nil ),
inference(rw,[status(thm)],[c_0_37,c_0_38]) ).
cnf(c_0_47,negated_conjecture,
( ssList(sk8)
| ~ neq(sk4,nil) ),
c_0_39 ).
cnf(c_0_48,negated_conjecture,
( ssItem(sk5)
| nil = sk2 ),
co1_8 ).
cnf(c_0_49,negated_conjecture,
( app(cons(sk7,nil),sk8) = sk4
| ~ neq(sk4,nil) ),
inference(fof_simplification,[status(thm)],[co1_18]) ).
cnf(c_0_50,negated_conjecture,
( sk4 = nil
| ssItem(sk7) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_41]),c_0_42]),c_0_43])]) ).
cnf(c_0_51,negated_conjecture,
sk4 != nil,
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_45]),c_0_35]),c_0_36]),c_0_46]) ).
cnf(c_0_52,negated_conjecture,
( sk4 = nil
| ssList(sk8) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_41]),c_0_42]),c_0_43])]) ).
cnf(c_0_53,plain,
( X4 = X2
| cons(X1,X2) != cons(X3,X4)
| ~ ssItem(X3)
| ~ ssItem(X1)
| ~ ssList(X4)
| ~ ssList(X2) ),
inference(fof_simplification,[status(thm)],[clause171]) ).
cnf(c_0_54,negated_conjecture,
( sk4 = nil
| ssItem(sk5) ),
inference(rw,[status(thm)],[c_0_48,c_0_24]) ).
cnf(c_0_55,negated_conjecture,
( app(cons(sk7,nil),sk8) = sk4
| ~ neq(sk4,nil) ),
c_0_49 ).
cnf(c_0_56,negated_conjecture,
ssItem(sk7),
inference(sr,[status(thm)],[c_0_50,c_0_51]) ).
cnf(c_0_57,negated_conjecture,
ssList(sk8),
inference(sr,[status(thm)],[c_0_52,c_0_51]) ).
cnf(c_0_58,negated_conjecture,
( app(cons(sk5,nil),sk6) = sk2
| nil = sk2 ),
co1_11 ).
cnf(c_0_59,negated_conjecture,
( ssList(sk6)
| nil = sk2 ),
co1_10 ).
cnf(c_0_60,plain,
( X4 = X2
| cons(X1,X2) != cons(X3,X4)
| ~ ssItem(X3)
| ~ ssItem(X1)
| ~ ssList(X4)
| ~ ssList(X2) ),
c_0_53 ).
cnf(c_0_61,negated_conjecture,
ssItem(sk5),
inference(sr,[status(thm)],[c_0_54,c_0_51]) ).
cnf(c_0_62,negated_conjecture,
( cons(sk7,sk8) = sk4
| ~ neq(sk4,nil) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_55,c_0_34]),c_0_56]),c_0_57])]) ).
cnf(c_0_63,negated_conjecture,
( app(cons(sk5,nil),sk6) = sk4
| sk4 = nil ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_58,c_0_24]),c_0_24]) ).
cnf(c_0_64,negated_conjecture,
( sk4 = nil
| ssList(sk6) ),
inference(rw,[status(thm)],[c_0_59,c_0_24]) ).
cnf(c_0_65,plain,
( X1 = X3
| app(X1,X2) != app(X3,X2)
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
inference(fof_simplification,[status(thm)],[clause151]) ).
cnf(c_0_66,negated_conjecture,
( X1 = X2
| cons(X3,X1) != cons(sk5,X2)
| ~ ssItem(X3)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(spm,[status(thm)],[c_0_60,c_0_61]) ).
cnf(c_0_67,negated_conjecture,
cons(sk7,sk8) = sk4,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_62,c_0_41]),c_0_42]),c_0_43])]),c_0_51]) ).
cnf(c_0_68,negated_conjecture,
app(cons(sk5,nil),sk6) = sk4,
inference(sr,[status(thm)],[c_0_63,c_0_51]) ).
cnf(c_0_69,negated_conjecture,
ssList(sk6),
inference(sr,[status(thm)],[c_0_64,c_0_51]) ).
cnf(c_0_70,plain,
( X1 = X3
| app(X1,X2) != app(X3,X2)
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
c_0_65 ).
cnf(c_0_71,plain,
( ssList(cons(X1,X2))
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(fof_simplification,[status(thm)],[clause86]) ).
cnf(c_0_72,negated_conjecture,
( sk8 = X1
| cons(sk5,X1) != sk4
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_66,c_0_67]),c_0_56]),c_0_57])]) ).
cnf(c_0_73,negated_conjecture,
cons(sk5,sk6) = sk4,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_68]),c_0_61]),c_0_69])]) ).
cnf(c_0_74,negated_conjecture,
( cons(sk5,nil) = X1
| app(X1,sk6) != sk4
| ~ ssList(cons(sk5,nil))
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_70,c_0_68]),c_0_69])]) ).
cnf(c_0_75,plain,
( ssList(cons(X1,X2))
| ~ ssItem(X1)
| ~ ssList(X2) ),
c_0_71 ).
cnf(c_0_76,negated_conjecture,
sk8 = sk6,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_72,c_0_73]),c_0_69])]) ).
cnf(c_0_77,negated_conjecture,
( app(sk8,cons(sk7,nil)) = sk3
| ~ neq(sk4,nil) ),
inference(fof_simplification,[status(thm)],[co1_19]) ).
cnf(c_0_78,negated_conjecture,
( cons(sk5,nil) = X1
| app(X1,sk6) != sk4
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_74,c_0_75]),c_0_61]),c_0_43])]) ).
cnf(c_0_79,negated_conjecture,
( app(cons(sk7,nil),sk6) = sk4
| ~ neq(sk4,nil) ),
inference(rw,[status(thm)],[c_0_55,c_0_76]) ).
cnf(c_0_80,negated_conjecture,
( app(sk8,cons(sk7,nil)) = sk3
| ~ neq(sk4,nil) ),
c_0_77 ).
cnf(c_0_81,negated_conjecture,
( cons(sk7,nil) = cons(sk5,nil)
| ~ neq(sk4,nil)
| ~ ssList(cons(sk7,nil)) ),
inference(spm,[status(thm)],[c_0_78,c_0_79]) ).
cnf(c_0_82,negated_conjecture,
( nil = sk2
| app(sk6,cons(sk5,nil)) != sk1 ),
inference(fof_simplification,[status(thm)],[co1_12]) ).
cnf(c_0_83,negated_conjecture,
( app(sk8,cons(sk7,nil)) = sk1
| ~ neq(sk4,nil) ),
inference(rw,[status(thm)],[c_0_80,c_0_38]) ).
cnf(c_0_84,negated_conjecture,
( cons(sk7,nil) = cons(sk5,nil)
| ~ ssList(cons(sk7,nil)) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_81,c_0_41]),c_0_42]),c_0_43])]),c_0_51]) ).
cnf(c_0_85,negated_conjecture,
( nil = sk2
| app(sk6,cons(sk5,nil)) != sk1 ),
c_0_82 ).
cnf(c_0_86,negated_conjecture,
( app(sk6,cons(sk7,nil)) = sk1
| ~ neq(sk4,nil) ),
inference(rw,[status(thm)],[c_0_83,c_0_76]) ).
cnf(c_0_87,negated_conjecture,
cons(sk7,nil) = cons(sk5,nil),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_84,c_0_75]),c_0_56]),c_0_43])]) ).
cnf(c_0_88,negated_conjecture,
( sk4 = nil
| app(sk6,cons(sk5,nil)) != sk1 ),
inference(rw,[status(thm)],[c_0_85,c_0_24]) ).
cnf(c_0_89,negated_conjecture,
( app(sk6,cons(sk5,nil)) = sk1
| ~ neq(sk4,nil) ),
inference(rw,[status(thm)],[c_0_86,c_0_87]) ).
cnf(c_0_90,negated_conjecture,
~ neq(sk4,nil),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_88,c_0_89]),c_0_51]) ).
cnf(c_0_91,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_90,c_0_41]),c_0_42]),c_0_43])]),c_0_51]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : SWC315-1 : TPTP v8.2.0. Released v2.4.0.
% 0.12/0.13 % Command : run_E %s %d THM
% 0.13/0.35 % Computer : n027.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Sun May 19 03:19:53 EDT 2024
% 0.13/0.35 % CPUTime :
% 0.21/0.48 Running first-order theorem proving
% 0.21/0.48 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.21/0.51 # Version: 3.1.0
% 0.21/0.51 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.21/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.51 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.21/0.51 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.51 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.51 # Starting sh5l with 300s (1) cores
% 0.21/0.51 # new_bool_1 with pid 1651 completed with status 0
% 0.21/0.51 # Result found by new_bool_1
% 0.21/0.51 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.21/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.51 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.21/0.51 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.51 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.51 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.21/0.51 # Search class: FGHSF-FFMM22-SFFFFFNN
% 0.21/0.51 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.51 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.21/0.51 # SAT001_MinMin_p005000_rr_RG with pid 1657 completed with status 0
% 0.21/0.51 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.21/0.51 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.21/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.51 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.21/0.51 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.51 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.51 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.21/0.51 # Search class: FGHSF-FFMM22-SFFFFFNN
% 0.21/0.51 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.51 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.21/0.51 # Preprocessing time : 0.002 s
% 0.21/0.51 # Presaturation interreduction done
% 0.21/0.51
% 0.21/0.51 # Proof found!
% 0.21/0.51 # SZS status Unsatisfiable
% 0.21/0.51 # SZS output start CNFRefutation
% See solution above
% 0.21/0.51 # Parsed axioms : 204
% 0.21/0.51 # Removed by relevancy pruning/SinE : 164
% 0.21/0.51 # Initial clauses : 40
% 0.21/0.51 # Removed in clause preprocessing : 0
% 0.21/0.51 # Initial clauses in saturation : 40
% 0.21/0.51 # Processed clauses : 195
% 0.21/0.51 # ...of these trivial : 2
% 0.21/0.51 # ...subsumed : 52
% 0.21/0.51 # ...remaining for further processing : 141
% 0.21/0.51 # Other redundant clauses eliminated : 8
% 0.21/0.51 # Clauses deleted for lack of memory : 0
% 0.21/0.51 # Backward-subsumed : 22
% 0.21/0.51 # Backward-rewritten : 17
% 0.21/0.51 # Generated clauses : 262
% 0.21/0.51 # ...of the previous two non-redundant : 232
% 0.21/0.51 # ...aggressively subsumed : 0
% 0.21/0.51 # Contextual simplify-reflections : 14
% 0.21/0.51 # Paramodulations : 247
% 0.21/0.51 # Factorizations : 0
% 0.21/0.51 # NegExts : 0
% 0.21/0.51 # Equation resolutions : 11
% 0.21/0.51 # Disequality decompositions : 0
% 0.21/0.51 # Total rewrite steps : 289
% 0.21/0.51 # ...of those cached : 272
% 0.21/0.51 # Propositional unsat checks : 0
% 0.21/0.51 # Propositional check models : 0
% 0.21/0.51 # Propositional check unsatisfiable : 0
% 0.21/0.51 # Propositional clauses : 0
% 0.21/0.51 # Propositional clauses after purity: 0
% 0.21/0.51 # Propositional unsat core size : 0
% 0.21/0.51 # Propositional preprocessing time : 0.000
% 0.21/0.51 # Propositional encoding time : 0.000
% 0.21/0.51 # Propositional solver time : 0.000
% 0.21/0.51 # Success case prop preproc time : 0.000
% 0.21/0.51 # Success case prop encoding time : 0.000
% 0.21/0.51 # Success case prop solver time : 0.000
% 0.21/0.51 # Current number of processed clauses : 56
% 0.21/0.51 # Positive orientable unit clauses : 15
% 0.21/0.51 # Positive unorientable unit clauses: 0
% 0.21/0.51 # Negative unit clauses : 8
% 0.21/0.51 # Non-unit-clauses : 33
% 0.21/0.51 # Current number of unprocessed clauses: 101
% 0.21/0.51 # ...number of literals in the above : 475
% 0.21/0.51 # Current number of archived formulas : 0
% 0.21/0.51 # Current number of archived clauses : 82
% 0.21/0.51 # Clause-clause subsumption calls (NU) : 388
% 0.21/0.51 # Rec. Clause-clause subsumption calls : 195
% 0.21/0.51 # Non-unit clause-clause subsumptions : 37
% 0.21/0.51 # Unit Clause-clause subsumption calls : 85
% 0.21/0.51 # Rewrite failures with RHS unbound : 0
% 0.21/0.51 # BW rewrite match attempts : 9
% 0.21/0.51 # BW rewrite match successes : 9
% 0.21/0.51 # Condensation attempts : 0
% 0.21/0.51 # Condensation successes : 0
% 0.21/0.51 # Termbank termtop insertions : 6415
% 0.21/0.51 # Search garbage collected termcells : 934
% 0.21/0.51
% 0.21/0.51 # -------------------------------------------------
% 0.21/0.51 # User time : 0.015 s
% 0.21/0.51 # System time : 0.002 s
% 0.21/0.51 # Total time : 0.017 s
% 0.21/0.51 # Maximum resident set size: 2080 pages
% 0.21/0.51
% 0.21/0.51 # -------------------------------------------------
% 0.21/0.51 # User time : 0.018 s
% 0.21/0.51 # System time : 0.006 s
% 0.21/0.51 # Total time : 0.023 s
% 0.21/0.51 # Maximum resident set size: 1876 pages
% 0.21/0.51 % E---3.1 exiting
% 0.21/0.51 % E exiting
%------------------------------------------------------------------------------