TSTP Solution File: SWC193-1 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : SWC193-1 : TPTP v8.2.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n029.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:28:14 EDT 2024
% Result : Unsatisfiable 0.13s 0.42s
% Output : CNFRefutation 0.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 25
% Syntax : Number of clauses : 86 ( 41 unt; 5 nHn; 84 RR)
% Number of literals : 192 ( 52 equ; 105 neg)
% Maximal clause size : 8 ( 2 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-2 aty)
% Number of functors : 12 ( 12 usr; 9 con; 0-2 aty)
% Number of variables : 73 ( 2 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(co1_12,negated_conjecture,
app(app(app(sk7,cons(sk5,nil)),cons(sk6,nil)),sk8) = sk1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_12) ).
cnf(co1_6,negated_conjecture,
sk1 = sk3,
file('/export/starexec/sandbox2/benchmark/theBenchmark.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/sandbox2/benchmark/Axioms/SWC001-0.ax',clause149) ).
cnf(co1_10,negated_conjecture,
ssList(sk7),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_10) ).
cnf(clause86,axiom,
( ssList(cons(X1,X2))
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause86) ).
cnf(co1_8,negated_conjecture,
ssItem(sk5),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_8) ).
cnf(clause8,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause8) ).
cnf(co1_9,negated_conjecture,
ssItem(sk6),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_9) ).
cnf(clause120,axiom,
( app(cons(X1,nil),X2) = cons(X1,X2)
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause120) ).
cnf(co1_11,negated_conjecture,
ssList(sk8),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_11) ).
cnf(clause157,axiom,
( cons(X1,app(X2,X3)) = app(cons(X1,X2),X3)
| ~ ssItem(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause157) ).
cnf(clause64,axiom,
( equalelemsP(cons(X1,nil))
| ~ ssItem(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause64) ).
cnf(clause101,axiom,
( cons(skaf44(X1),nil) = X1
| ~ singletonP(X1)
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause101) ).
cnf(co1_14,negated_conjecture,
( singletonP(sk3)
| ~ neq(sk4,nil) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_14) ).
cnf(clause100,axiom,
( neq(X2,X1)
| X2 = X1
| ~ ssList(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause100) ).
cnf(co1_2,negated_conjecture,
ssList(sk2),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_2) ).
cnf(co1_5,negated_conjecture,
sk2 = sk4,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_5) ).
cnf(clause180,axiom,
( X2 = X3
| app(X1,cons(X2,cons(X3,X4))) != X5
| ~ ssList(X4)
| ~ ssList(X1)
| ~ ssItem(X3)
| ~ ssItem(X2)
| ~ equalelemsP(X5)
| ~ ssList(X5) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause180) ).
cnf(clause47,axiom,
ssItem(skaf44(X1)),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause47) ).
cnf(co1_1,negated_conjecture,
ssList(sk1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_1) ).
cnf(co1_13,negated_conjecture,
sk5 != sk6,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_13) ).
cnf(clause127,axiom,
( X2 = X1
| ~ segmentP(X1,X2)
| ~ segmentP(X2,X1)
| ~ ssList(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause127) ).
cnf(co1_7,negated_conjecture,
segmentP(sk4,sk3),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_7) ).
cnf(clause56,axiom,
( segmentP(X1,nil)
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause56) ).
cnf(clause1,axiom,
equalelemsP(nil),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause1) ).
cnf(c_0_25,negated_conjecture,
app(app(app(sk7,cons(sk5,nil)),cons(sk6,nil)),sk8) = sk1,
co1_12 ).
cnf(c_0_26,negated_conjecture,
sk1 = sk3,
co1_6 ).
cnf(c_0_27,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_28,negated_conjecture,
app(app(app(sk7,cons(sk5,nil)),cons(sk6,nil)),sk8) = sk3,
inference(rw,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_29,plain,
( app(app(X3,X2),X1) = app(X3,app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
c_0_27 ).
cnf(c_0_30,negated_conjecture,
ssList(sk7),
co1_10 ).
cnf(c_0_31,plain,
( ssList(cons(X1,X2))
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(fof_simplification,[status(thm)],[clause86]) ).
cnf(c_0_32,negated_conjecture,
( app(app(sk7,app(cons(sk5,nil),cons(sk6,nil))),sk8) = sk3
| ~ ssList(cons(sk5,nil))
| ~ ssList(cons(sk6,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_30])]) ).
cnf(c_0_33,plain,
( ssList(cons(X1,X2))
| ~ ssItem(X1)
| ~ ssList(X2) ),
c_0_31 ).
cnf(c_0_34,negated_conjecture,
ssItem(sk5),
co1_8 ).
cnf(c_0_35,axiom,
ssList(nil),
clause8 ).
cnf(c_0_36,negated_conjecture,
( app(app(sk7,app(cons(sk5,nil),cons(sk6,nil))),sk8) = sk3
| ~ ssList(cons(sk6,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_34]),c_0_35])]) ).
cnf(c_0_37,negated_conjecture,
ssItem(sk6),
co1_9 ).
cnf(c_0_38,plain,
( app(cons(X1,nil),X2) = cons(X1,X2)
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(fof_simplification,[status(thm)],[clause120]) ).
cnf(c_0_39,negated_conjecture,
app(app(sk7,app(cons(sk5,nil),cons(sk6,nil))),sk8) = sk3,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_33]),c_0_37]),c_0_35])]) ).
cnf(c_0_40,plain,
( app(cons(X1,nil),X2) = cons(X1,X2)
| ~ ssItem(X1)
| ~ ssList(X2) ),
c_0_38 ).
cnf(c_0_41,negated_conjecture,
( app(app(sk7,cons(sk5,cons(sk6,nil))),sk8) = sk3
| ~ ssList(cons(sk6,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_40]),c_0_34])]) ).
cnf(c_0_42,negated_conjecture,
app(app(sk7,cons(sk5,cons(sk6,nil))),sk8) = sk3,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_33]),c_0_37]),c_0_35])]) ).
cnf(c_0_43,negated_conjecture,
ssList(sk8),
co1_11 ).
cnf(c_0_44,negated_conjecture,
( app(sk7,app(cons(sk5,cons(sk6,nil)),sk8)) = sk3
| ~ ssList(cons(sk5,cons(sk6,nil))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_42]),c_0_30]),c_0_43])]) ).
cnf(c_0_45,negated_conjecture,
( app(sk7,app(cons(sk5,cons(sk6,nil)),sk8)) = sk3
| ~ ssList(cons(sk6,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_33]),c_0_34])]) ).
cnf(c_0_46,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_47,negated_conjecture,
app(sk7,app(cons(sk5,cons(sk6,nil)),sk8)) = sk3,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_33]),c_0_37]),c_0_35])]) ).
cnf(c_0_48,plain,
( cons(X1,app(X2,X3)) = app(cons(X1,X2),X3)
| ~ ssItem(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
c_0_46 ).
cnf(c_0_49,plain,
( equalelemsP(cons(X1,nil))
| ~ ssItem(X1) ),
inference(fof_simplification,[status(thm)],[clause64]) ).
cnf(c_0_50,plain,
( cons(skaf44(X1),nil) = X1
| ~ singletonP(X1)
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause101]) ).
cnf(c_0_51,negated_conjecture,
( singletonP(sk3)
| ~ neq(sk4,nil) ),
inference(fof_simplification,[status(thm)],[co1_14]) ).
cnf(c_0_52,plain,
( neq(X2,X1)
| X2 = X1
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(fof_simplification,[status(thm)],[clause100]) ).
cnf(c_0_53,negated_conjecture,
ssList(sk2),
co1_2 ).
cnf(c_0_54,negated_conjecture,
sk2 = sk4,
co1_5 ).
cnf(c_0_55,plain,
( X2 = X3
| app(X1,cons(X2,cons(X3,X4))) != X5
| ~ ssList(X4)
| ~ ssList(X1)
| ~ ssItem(X3)
| ~ ssItem(X2)
| ~ equalelemsP(X5)
| ~ ssList(X5) ),
inference(fof_simplification,[status(thm)],[clause180]) ).
cnf(c_0_56,negated_conjecture,
( app(sk7,cons(sk5,app(cons(sk6,nil),sk8))) = sk3
| ~ ssList(cons(sk6,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_48]),c_0_34]),c_0_43])]) ).
cnf(c_0_57,plain,
( equalelemsP(cons(X1,nil))
| ~ ssItem(X1) ),
c_0_49 ).
cnf(c_0_58,plain,
( cons(skaf44(X1),nil) = X1
| ~ singletonP(X1)
| ~ ssList(X1) ),
c_0_50 ).
cnf(c_0_59,axiom,
ssItem(skaf44(X1)),
clause47 ).
cnf(c_0_60,negated_conjecture,
( singletonP(sk3)
| ~ neq(sk4,nil) ),
c_0_51 ).
cnf(c_0_61,plain,
( neq(X2,X1)
| X2 = X1
| ~ ssList(X1)
| ~ ssList(X2) ),
c_0_52 ).
cnf(c_0_62,negated_conjecture,
ssList(sk4),
inference(rw,[status(thm)],[c_0_53,c_0_54]) ).
cnf(c_0_63,negated_conjecture,
ssList(sk1),
co1_1 ).
cnf(c_0_64,plain,
( X2 = X3
| app(X1,cons(X2,cons(X3,X4))) != X5
| ~ ssList(X4)
| ~ ssList(X1)
| ~ ssItem(X3)
| ~ ssItem(X2)
| ~ equalelemsP(X5)
| ~ ssList(X5) ),
c_0_55 ).
cnf(c_0_65,negated_conjecture,
app(sk7,cons(sk5,app(cons(sk6,nil),sk8))) = sk3,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_56,c_0_33]),c_0_37]),c_0_35])]) ).
cnf(c_0_66,negated_conjecture,
sk5 != sk6,
inference(fof_simplification,[status(thm)],[co1_13]) ).
cnf(c_0_67,plain,
( X2 = X1
| ~ segmentP(X1,X2)
| ~ segmentP(X2,X1)
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(fof_simplification,[status(thm)],[clause127]) ).
cnf(c_0_68,plain,
( equalelemsP(X1)
| ~ singletonP(X1)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_57,c_0_58]),c_0_59])]) ).
cnf(c_0_69,negated_conjecture,
( sk4 = nil
| singletonP(sk3) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_60,c_0_61]),c_0_62]),c_0_35])]) ).
cnf(c_0_70,negated_conjecture,
ssList(sk3),
inference(rw,[status(thm)],[c_0_63,c_0_26]) ).
cnf(c_0_71,plain,
( X1 = X2
| ~ ssItem(X2)
| ~ ssItem(X1)
| ~ ssList(app(X3,cons(X1,cons(X2,X4))))
| ~ ssList(X4)
| ~ ssList(X3)
| ~ equalelemsP(app(X3,cons(X1,cons(X2,X4)))) ),
inference(er,[status(thm)],[c_0_64]) ).
cnf(c_0_72,negated_conjecture,
app(sk7,cons(sk5,cons(sk6,sk8))) = sk3,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_65,c_0_40]),c_0_37]),c_0_43])]) ).
cnf(c_0_73,negated_conjecture,
sk5 != sk6,
c_0_66 ).
cnf(c_0_74,plain,
( X2 = X1
| ~ segmentP(X1,X2)
| ~ segmentP(X2,X1)
| ~ ssList(X1)
| ~ ssList(X2) ),
c_0_67 ).
cnf(c_0_75,negated_conjecture,
segmentP(sk4,sk3),
co1_7 ).
cnf(c_0_76,negated_conjecture,
( sk4 = nil
| equalelemsP(sk3) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_68,c_0_69]),c_0_70])]) ).
cnf(c_0_77,negated_conjecture,
~ equalelemsP(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(spm,[status(thm)],[c_0_71,c_0_72]),c_0_37]),c_0_34]),c_0_70]),c_0_43]),c_0_30])]),c_0_73]) ).
cnf(c_0_78,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_74,c_0_75]),c_0_62]),c_0_70])]) ).
cnf(c_0_79,negated_conjecture,
sk4 = nil,
inference(sr,[status(thm)],[c_0_76,c_0_77]) ).
cnf(c_0_80,plain,
( segmentP(X1,nil)
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause56]) ).
cnf(c_0_81,negated_conjecture,
( sk3 = nil
| ~ segmentP(sk3,nil) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_78,c_0_79]),c_0_79]) ).
cnf(c_0_82,plain,
( segmentP(X1,nil)
| ~ ssList(X1) ),
c_0_80 ).
cnf(c_0_83,negated_conjecture,
sk3 = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_81,c_0_82]),c_0_70])]) ).
cnf(c_0_84,axiom,
equalelemsP(nil),
clause1 ).
cnf(c_0_85,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_77,c_0_83]),c_0_84])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.08 % Problem : SWC193-1 : TPTP v8.2.0. Released v2.4.0.
% 0.00/0.08 % Command : run_E %s %d THM
% 0.07/0.28 % Computer : n029.cluster.edu
% 0.07/0.28 % Model : x86_64 x86_64
% 0.07/0.28 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.28 % Memory : 8042.1875MB
% 0.07/0.28 % OS : Linux 3.10.0-693.el7.x86_64
% 0.07/0.28 % CPULimit : 300
% 0.07/0.28 % WCLimit : 300
% 0.07/0.28 % DateTime : Sun May 19 03:34:38 EDT 2024
% 0.07/0.29 % CPUTime :
% 0.07/0.37 Running first-order model finding
% 0.07/0.37 Running: /export/starexec/sandbox2/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/sandbox2/benchmark/theBenchmark.p
% 0.13/0.42 # Version: 3.1.0
% 0.13/0.42 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.13/0.42 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.42 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.13/0.42 # Starting new_bool_3 with 300s (1) cores
% 0.13/0.42 # Starting new_bool_1 with 300s (1) cores
% 0.13/0.42 # Starting sh5l with 300s (1) cores
% 0.13/0.42 # C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 26220 completed with status 0
% 0.13/0.42 # Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.13/0.42 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.13/0.42 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.42 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.13/0.42 # No SInE strategy applied
% 0.13/0.42 # Search class: FGHSM-FSLM21-MFFFFFNN
% 0.13/0.42 # Scheduled 9 strats onto 5 cores with 1500 seconds (1500 total)
% 0.13/0.42 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2s with 406s (1) cores
% 0.13/0.42 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.13/0.42 # Starting G-E--_200_B02_F1_SE_CS_SP_PI_S2k with 136s (1) cores
% 0.13/0.42 # Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S04BN with 136s (1) cores
% 0.13/0.42 # Starting G-E--_200_B02_F1_SE_CS_SP_PI_S0S with 136s (1) cores
% 0.13/0.42 # G-E--_208_C18_F1_SE_CS_SP_PS_S2s with pid 26226 completed with status 0
% 0.13/0.42 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S2s
% 0.13/0.42 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.13/0.42 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.42 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.13/0.42 # No SInE strategy applied
% 0.13/0.42 # Search class: FGHSM-FSLM21-MFFFFFNN
% 0.13/0.42 # Scheduled 9 strats onto 5 cores with 1500 seconds (1500 total)
% 0.13/0.42 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2s with 406s (1) cores
% 0.13/0.42 # Preprocessing time : 0.002 s
% 0.13/0.42 # Presaturation interreduction done
% 0.13/0.42
% 0.13/0.42 # Proof found!
% 0.13/0.42 # SZS status Unsatisfiable
% 0.13/0.42 # SZS output start CNFRefutation
% See solution above
% 0.13/0.42 # Parsed axioms : 199
% 0.13/0.42 # Removed by relevancy pruning/SinE : 0
% 0.13/0.42 # Initial clauses : 199
% 0.13/0.42 # Removed in clause preprocessing : 0
% 0.13/0.42 # Initial clauses in saturation : 199
% 0.13/0.42 # Processed clauses : 507
% 0.13/0.42 # ...of these trivial : 2
% 0.13/0.42 # ...subsumed : 31
% 0.13/0.42 # ...remaining for further processing : 474
% 0.13/0.42 # Other redundant clauses eliminated : 48
% 0.13/0.42 # Clauses deleted for lack of memory : 0
% 0.13/0.42 # Backward-subsumed : 7
% 0.13/0.42 # Backward-rewritten : 55
% 0.13/0.42 # Generated clauses : 595
% 0.13/0.42 # ...of the previous two non-redundant : 512
% 0.13/0.42 # ...aggressively subsumed : 0
% 0.13/0.42 # Contextual simplify-reflections : 10
% 0.13/0.42 # Paramodulations : 542
% 0.13/0.42 # Factorizations : 0
% 0.13/0.42 # NegExts : 0
% 0.13/0.42 # Equation resolutions : 53
% 0.13/0.42 # Disequality decompositions : 0
% 0.13/0.42 # Total rewrite steps : 603
% 0.13/0.42 # ...of those cached : 559
% 0.13/0.42 # Propositional unsat checks : 0
% 0.13/0.42 # Propositional check models : 0
% 0.13/0.42 # Propositional check unsatisfiable : 0
% 0.13/0.42 # Propositional clauses : 0
% 0.13/0.42 # Propositional clauses after purity: 0
% 0.13/0.42 # Propositional unsat core size : 0
% 0.13/0.42 # Propositional preprocessing time : 0.000
% 0.13/0.42 # Propositional encoding time : 0.000
% 0.13/0.42 # Propositional solver time : 0.000
% 0.13/0.42 # Success case prop preproc time : 0.000
% 0.13/0.42 # Success case prop encoding time : 0.000
% 0.13/0.42 # Success case prop solver time : 0.000
% 0.13/0.42 # Current number of processed clauses : 197
% 0.13/0.42 # Positive orientable unit clauses : 65
% 0.13/0.42 # Positive unorientable unit clauses: 0
% 0.13/0.42 # Negative unit clauses : 3
% 0.13/0.42 # Non-unit-clauses : 129
% 0.13/0.42 # Current number of unprocessed clauses: 389
% 0.13/0.42 # ...number of literals in the above : 1807
% 0.13/0.42 # Current number of archived formulas : 0
% 0.13/0.42 # Current number of archived clauses : 254
% 0.13/0.42 # Clause-clause subsumption calls (NU) : 11296
% 0.13/0.42 # Rec. Clause-clause subsumption calls : 1959
% 0.13/0.42 # Non-unit clause-clause subsumptions : 42
% 0.13/0.42 # Unit Clause-clause subsumption calls : 257
% 0.13/0.42 # Rewrite failures with RHS unbound : 0
% 0.13/0.42 # BW rewrite match attempts : 13
% 0.13/0.42 # BW rewrite match successes : 11
% 0.13/0.42 # Condensation attempts : 0
% 0.13/0.42 # Condensation successes : 0
% 0.13/0.42 # Termbank termtop insertions : 19059
% 0.13/0.42 # Search garbage collected termcells : 532
% 0.13/0.42
% 0.13/0.42 # -------------------------------------------------
% 0.13/0.42 # User time : 0.034 s
% 0.13/0.42 # System time : 0.005 s
% 0.13/0.42 # Total time : 0.039 s
% 0.13/0.42 # Maximum resident set size: 2140 pages
% 0.13/0.42
% 0.13/0.42 # -------------------------------------------------
% 0.13/0.42 # User time : 0.149 s
% 0.13/0.42 # System time : 0.015 s
% 0.13/0.42 # Total time : 0.164 s
% 0.13/0.42 # Maximum resident set size: 1876 pages
% 0.13/0.42 % E---3.1 exiting
%------------------------------------------------------------------------------