TSTP Solution File: SWC401-1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SWC401-1 : TPTP v8.2.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n023.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:26:27 EDT 2024
% Result : Unsatisfiable 2.05s 0.64s
% Output : CNFRefutation 2.05s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 24
% Syntax : Number of clauses : 83 ( 36 unt; 4 nHn; 64 RR)
% Number of literals : 222 ( 25 equ; 144 neg)
% Maximal clause size : 7 ( 2 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-2 aty)
% Number of functors : 12 ( 12 usr; 5 con; 0-2 aty)
% Number of variables : 136 ( 30 sgn)
% Comments :
%------------------------------------------------------------------------------
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/benchmark/Axioms/SWC001-0.ax',clause179) ).
cnf(clause169,axiom,
( app(skaf42(X1,X2),cons(X2,skaf43(X2,X1))) = X1
| ~ memberP(X1,X2)
| ~ ssItem(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause169) ).
cnf(co1_11,negated_conjecture,
memberP(sk1,sk5),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_11) ).
cnf(co1_10,negated_conjecture,
ssItem(sk5),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_10) ).
cnf(co1_1,negated_conjecture,
ssList(sk1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_1) ).
cnf(clause72,axiom,
( duplicatefreeP(X1)
| ssItem(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause72) ).
cnf(clause85,axiom,
( ssList(app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause85) ).
cnf(clause52,axiom,
ssList(skaf43(X1,X2)),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause52) ).
cnf(clause53,axiom,
ssList(skaf42(X1,X2)),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause53) ).
cnf(clause86,axiom,
( ssList(cons(X1,X2))
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause86) ).
cnf(clause144,axiom,
( frontsegP(X3,X1)
| app(X1,X2) != X3
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(X3) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause144) ).
cnf(clause149,axiom,
( app(app(X3,X2),X1) = app(X3,app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause149) ).
cnf(clause132,axiom,
( app(X2,skaf45(X1,X2)) = X1
| ~ frontsegP(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause132) ).
cnf(clause140,axiom,
( memberP(app(X1,X3),X2)
| ~ memberP(X1,X2)
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssItem(X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause140) ).
cnf(clause141,axiom,
( memberP(app(X3,X1),X2)
| ~ memberP(X1,X2)
| ~ ssList(X1)
| ~ ssList(X3)
| ~ ssItem(X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause141) ).
cnf(clause51,axiom,
ssList(skaf45(X1,X2)),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause51) ).
cnf(clause168,axiom,
( app(app(skaf47(X1,X2),X2),skaf48(X2,X1)) = X1
| ~ segmentP(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause168) ).
cnf(co1_7,negated_conjecture,
segmentP(sk4,sk3),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_7) ).
cnf(co1_6,negated_conjecture,
sk1 = sk3,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_6) ).
cnf(co1_2,negated_conjecture,
ssList(sk2),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_2) ).
cnf(co1_5,negated_conjecture,
sk2 = sk4,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_5) ).
cnf(co1_12,negated_conjecture,
~ memberP(sk2,sk5),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_12) ).
cnf(clause48,axiom,
ssList(skaf48(X1,X2)),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause48) ).
cnf(clause49,axiom,
ssList(skaf47(X1,X2)),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause49) ).
cnf(c_0_24,plain,
( app(app(X1,cons(X2,X3)),cons(X2,X4)) != X5
| ~ ssList(X4)
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssItem(X2)
| ~ duplicatefreeP(X5)
| ~ ssList(X5) ),
inference(fof_simplification,[status(thm)],[clause179]) ).
cnf(c_0_25,plain,
( app(skaf42(X1,X2),cons(X2,skaf43(X2,X1))) = X1
| ~ memberP(X1,X2)
| ~ ssItem(X2)
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause169]) ).
cnf(c_0_26,plain,
( app(app(X1,cons(X2,X3)),cons(X2,X4)) != X5
| ~ ssList(X4)
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssItem(X2)
| ~ duplicatefreeP(X5)
| ~ ssList(X5) ),
c_0_24 ).
cnf(c_0_27,plain,
( app(skaf42(X1,X2),cons(X2,skaf43(X2,X1))) = X1
| ~ memberP(X1,X2)
| ~ ssItem(X2)
| ~ ssList(X1) ),
c_0_25 ).
cnf(c_0_28,negated_conjecture,
memberP(sk1,sk5),
co1_11 ).
cnf(c_0_29,negated_conjecture,
ssItem(sk5),
co1_10 ).
cnf(c_0_30,negated_conjecture,
ssList(sk1),
co1_1 ).
cnf(c_0_31,plain,
( duplicatefreeP(X1)
| ssItem(X2)
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause72]) ).
cnf(c_0_32,plain,
( ssList(app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(fof_simplification,[status(thm)],[clause85]) ).
cnf(c_0_33,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_26]) ).
cnf(c_0_34,negated_conjecture,
app(skaf42(sk1,sk5),cons(sk5,skaf43(sk5,sk1))) = sk1,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_29]),c_0_30])]) ).
cnf(c_0_35,axiom,
ssList(skaf43(X1,X2)),
clause52 ).
cnf(c_0_36,axiom,
ssList(skaf42(X1,X2)),
clause53 ).
cnf(c_0_37,plain,
( duplicatefreeP(X1)
| ssItem(X2)
| ~ ssList(X1) ),
c_0_31 ).
cnf(c_0_38,plain,
( ssList(app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2) ),
c_0_32 ).
cnf(c_0_39,negated_conjecture,
( ~ ssList(app(sk1,cons(sk5,X1)))
| ~ ssList(X1)
| ~ duplicatefreeP(app(sk1,cons(sk5,X1))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_29]),c_0_35]),c_0_36])]) ).
cnf(c_0_40,plain,
( ssItem(X1)
| duplicatefreeP(app(X2,X3))
| ~ ssList(X2)
| ~ ssList(X3) ),
inference(spm,[status(thm)],[c_0_37,c_0_38]) ).
cnf(c_0_41,plain,
( ssList(cons(X1,X2))
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(fof_simplification,[status(thm)],[clause86]) ).
cnf(c_0_42,plain,
( frontsegP(X3,X1)
| app(X1,X2) != X3
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(X3) ),
inference(fof_simplification,[status(thm)],[clause144]) ).
cnf(c_0_43,negated_conjecture,
( ssItem(X1)
| ~ ssList(app(sk1,cons(sk5,X2)))
| ~ ssList(cons(sk5,X2))
| ~ ssList(X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_40]),c_0_30])]) ).
cnf(c_0_44,plain,
( ssList(cons(X1,X2))
| ~ ssItem(X1)
| ~ ssList(X2) ),
c_0_41 ).
cnf(c_0_45,plain,
( frontsegP(X3,X1)
| app(X1,X2) != X3
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(X3) ),
c_0_42 ).
cnf(c_0_46,negated_conjecture,
( ssItem(X1)
| ~ ssList(app(sk1,cons(sk5,X2)))
| ~ ssList(X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_44]),c_0_29])]) ).
cnf(c_0_47,plain,
( frontsegP(app(X1,X2),X1)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(csr,[status(thm)],[inference(er,[status(thm)],[c_0_45]),c_0_38]) ).
cnf(c_0_48,negated_conjecture,
( ssItem(X1)
| ~ ssList(cons(sk5,X2))
| ~ ssList(X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_38]),c_0_30])]) ).
cnf(c_0_49,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_50,plain,
( app(X2,skaf45(X1,X2)) = X1
| ~ frontsegP(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause132]) ).
cnf(c_0_51,negated_conjecture,
( frontsegP(sk1,skaf42(sk1,sk5))
| ~ ssList(cons(sk5,skaf43(sk5,sk1))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_34]),c_0_36])]) ).
cnf(c_0_52,plain,
( memberP(app(X1,X3),X2)
| ~ memberP(X1,X2)
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssItem(X2) ),
inference(fof_simplification,[status(thm)],[clause140]) ).
cnf(c_0_53,negated_conjecture,
( ssItem(X1)
| ~ ssList(X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_44]),c_0_29])]) ).
cnf(c_0_54,plain,
( memberP(app(X3,X1),X2)
| ~ memberP(X1,X2)
| ~ ssList(X1)
| ~ ssList(X3)
| ~ ssItem(X2) ),
inference(fof_simplification,[status(thm)],[clause141]) ).
cnf(c_0_55,plain,
( app(app(X3,X2),X1) = app(X3,app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
c_0_49 ).
cnf(c_0_56,plain,
( app(X2,skaf45(X1,X2)) = X1
| ~ frontsegP(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
c_0_50 ).
cnf(c_0_57,negated_conjecture,
frontsegP(sk1,skaf42(sk1,sk5)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_44]),c_0_29]),c_0_35])]) ).
cnf(c_0_58,plain,
( memberP(app(X1,X3),X2)
| ~ memberP(X1,X2)
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssItem(X2) ),
c_0_52 ).
cnf(c_0_59,negated_conjecture,
ssItem(X1),
inference(spm,[status(thm)],[c_0_53,c_0_36]) ).
cnf(c_0_60,plain,
( memberP(app(X3,X1),X2)
| ~ memberP(X1,X2)
| ~ ssList(X1)
| ~ ssList(X3)
| ~ ssItem(X2) ),
c_0_54 ).
cnf(c_0_61,plain,
( ssList(app(X1,app(X2,X3)))
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_55]),c_0_38]) ).
cnf(c_0_62,negated_conjecture,
app(skaf42(sk1,sk5),skaf45(sk1,skaf42(sk1,sk5))) = sk1,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_56,c_0_57]),c_0_36]),c_0_30])]) ).
cnf(c_0_63,axiom,
ssList(skaf45(X1,X2)),
clause51 ).
cnf(c_0_64,plain,
( app(app(skaf47(X1,X2),X2),skaf48(X2,X1)) = X1
| ~ segmentP(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause168]) ).
cnf(c_0_65,negated_conjecture,
segmentP(sk4,sk3),
co1_7 ).
cnf(c_0_66,negated_conjecture,
sk1 = sk3,
co1_6 ).
cnf(c_0_67,negated_conjecture,
ssList(sk2),
co1_2 ).
cnf(c_0_68,negated_conjecture,
sk2 = sk4,
co1_5 ).
cnf(c_0_69,negated_conjecture,
~ memberP(sk2,sk5),
inference(fof_simplification,[status(thm)],[co1_12]) ).
cnf(c_0_70,plain,
( memberP(app(X1,X2),X3)
| ~ memberP(X1,X3)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_58,c_0_59])]) ).
cnf(c_0_71,negated_conjecture,
( memberP(app(X1,sk1),sk5)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_60,c_0_28]),c_0_29]),c_0_30])]) ).
cnf(c_0_72,negated_conjecture,
( ssList(app(X1,sk1))
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_61,c_0_62]),c_0_63]),c_0_36])]) ).
cnf(c_0_73,plain,
( app(app(skaf47(X1,X2),X2),skaf48(X2,X1)) = X1
| ~ segmentP(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
c_0_64 ).
cnf(c_0_74,negated_conjecture,
segmentP(sk4,sk1),
inference(rw,[status(thm)],[c_0_65,c_0_66]) ).
cnf(c_0_75,negated_conjecture,
ssList(sk4),
inference(rw,[status(thm)],[c_0_67,c_0_68]) ).
cnf(c_0_76,negated_conjecture,
~ memberP(sk2,sk5),
c_0_69 ).
cnf(c_0_77,negated_conjecture,
( memberP(app(app(X1,sk1),X2),sk5)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_70,c_0_71]),c_0_72]) ).
cnf(c_0_78,negated_conjecture,
app(app(skaf47(sk4,sk1),sk1),skaf48(sk1,sk4)) = sk4,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_73,c_0_74]),c_0_30]),c_0_75])]) ).
cnf(c_0_79,axiom,
ssList(skaf48(X1,X2)),
clause48 ).
cnf(c_0_80,axiom,
ssList(skaf47(X1,X2)),
clause49 ).
cnf(c_0_81,negated_conjecture,
~ memberP(sk4,sk5),
inference(rw,[status(thm)],[c_0_76,c_0_68]) ).
cnf(c_0_82,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_77,c_0_78]),c_0_79]),c_0_80])]),c_0_81]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.07 % Problem : SWC401-1 : TPTP v8.2.0. Released v2.4.0.
% 0.04/0.07 % Command : run_E %s %d THM
% 0.07/0.26 % Computer : n023.cluster.edu
% 0.07/0.26 % Model : x86_64 x86_64
% 0.07/0.26 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.26 % Memory : 8042.1875MB
% 0.07/0.26 % OS : Linux 3.10.0-693.el7.x86_64
% 0.07/0.26 % CPULimit : 300
% 0.07/0.26 % WCLimit : 300
% 0.07/0.26 % DateTime : Sun May 19 02:49:08 EDT 2024
% 0.10/0.26 % CPUTime :
% 0.10/0.38 Running first-order theorem proving
% 0.10/0.38 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
% 2.05/0.64 # Version: 3.1.0
% 2.05/0.64 # Preprocessing class: FSLSSMSMSSSNFFN.
% 2.05/0.64 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.05/0.64 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 2.05/0.64 # Starting new_bool_3 with 300s (1) cores
% 2.05/0.64 # Starting new_bool_1 with 300s (1) cores
% 2.05/0.64 # Starting sh5l with 300s (1) cores
% 2.05/0.64 # C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 7773 completed with status 0
% 2.05/0.64 # Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 2.05/0.64 # Preprocessing class: FSLSSMSMSSSNFFN.
% 2.05/0.64 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.05/0.64 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 2.05/0.64 # No SInE strategy applied
% 2.05/0.64 # Search class: FGHSM-FSLM21-MFFFFFNN
% 2.05/0.64 # Scheduled 9 strats onto 5 cores with 1500 seconds (1500 total)
% 2.05/0.64 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2s with 406s (1) cores
% 2.05/0.64 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 2.05/0.64 # Starting G-E--_200_B02_F1_SE_CS_SP_PI_S2k with 136s (1) cores
% 2.05/0.64 # Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S04BN with 136s (1) cores
% 2.05/0.64 # Starting G-E--_200_B02_F1_SE_CS_SP_PI_S0S with 136s (1) cores
% 2.05/0.64 # G-E--_200_B02_F1_SE_CS_SP_PI_S2k with pid 7781 completed with status 0
% 2.05/0.64 # Result found by G-E--_200_B02_F1_SE_CS_SP_PI_S2k
% 2.05/0.64 # Preprocessing class: FSLSSMSMSSSNFFN.
% 2.05/0.64 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.05/0.64 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 2.05/0.64 # No SInE strategy applied
% 2.05/0.64 # Search class: FGHSM-FSLM21-MFFFFFNN
% 2.05/0.64 # Scheduled 9 strats onto 5 cores with 1500 seconds (1500 total)
% 2.05/0.64 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2s with 406s (1) cores
% 2.05/0.64 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 2.05/0.64 # Starting G-E--_200_B02_F1_SE_CS_SP_PI_S2k with 136s (1) cores
% 2.05/0.64 # Preprocessing time : 0.002 s
% 2.05/0.64
% 2.05/0.64 # Proof found!
% 2.05/0.64 # SZS status Unsatisfiable
% 2.05/0.64 # SZS output start CNFRefutation
% See solution above
% 2.05/0.64 # Parsed axioms : 197
% 2.05/0.64 # Removed by relevancy pruning/SinE : 0
% 2.05/0.64 # Initial clauses : 197
% 2.05/0.64 # Removed in clause preprocessing : 0
% 2.05/0.64 # Initial clauses in saturation : 197
% 2.05/0.64 # Processed clauses : 3105
% 2.05/0.64 # ...of these trivial : 51
% 2.05/0.64 # ...subsumed : 1772
% 2.05/0.64 # ...remaining for further processing : 1282
% 2.05/0.64 # Other redundant clauses eliminated : 319
% 2.05/0.64 # Clauses deleted for lack of memory : 0
% 2.05/0.64 # Backward-subsumed : 110
% 2.05/0.64 # Backward-rewritten : 181
% 2.05/0.64 # Generated clauses : 10828
% 2.05/0.64 # ...of the previous two non-redundant : 9527
% 2.05/0.64 # ...aggressively subsumed : 0
% 2.05/0.64 # Contextual simplify-reflections : 100
% 2.05/0.64 # Paramodulations : 10484
% 2.05/0.64 # Factorizations : 0
% 2.05/0.64 # NegExts : 0
% 2.05/0.64 # Equation resolutions : 329
% 2.05/0.64 # Disequality decompositions : 0
% 2.05/0.64 # Total rewrite steps : 13006
% 2.05/0.64 # ...of those cached : 12531
% 2.05/0.64 # Propositional unsat checks : 0
% 2.05/0.64 # Propositional check models : 0
% 2.05/0.64 # Propositional check unsatisfiable : 0
% 2.05/0.64 # Propositional clauses : 0
% 2.05/0.64 # Propositional clauses after purity: 0
% 2.05/0.64 # Propositional unsat core size : 0
% 2.05/0.64 # Propositional preprocessing time : 0.000
% 2.05/0.64 # Propositional encoding time : 0.000
% 2.05/0.64 # Propositional solver time : 0.000
% 2.05/0.64 # Success case prop preproc time : 0.000
% 2.05/0.64 # Success case prop encoding time : 0.000
% 2.05/0.64 # Success case prop solver time : 0.000
% 2.05/0.64 # Current number of processed clauses : 952
% 2.05/0.64 # Positive orientable unit clauses : 178
% 2.05/0.64 # Positive unorientable unit clauses: 0
% 2.05/0.64 # Negative unit clauses : 44
% 2.05/0.64 # Non-unit-clauses : 730
% 2.05/0.64 # Current number of unprocessed clauses: 5889
% 2.05/0.64 # ...number of literals in the above : 28388
% 2.05/0.64 # Current number of archived formulas : 0
% 2.05/0.64 # Current number of archived clauses : 307
% 2.05/0.64 # Clause-clause subsumption calls (NU) : 138682
% 2.05/0.64 # Rec. Clause-clause subsumption calls : 38238
% 2.05/0.64 # Non-unit clause-clause subsumptions : 1269
% 2.05/0.64 # Unit Clause-clause subsumption calls : 4256
% 2.05/0.64 # Rewrite failures with RHS unbound : 0
% 2.05/0.64 # BW rewrite match attempts : 73
% 2.05/0.64 # BW rewrite match successes : 57
% 2.05/0.64 # Condensation attempts : 0
% 2.05/0.64 # Condensation successes : 0
% 2.05/0.64 # Termbank termtop insertions : 221867
% 2.05/0.64 # Search garbage collected termcells : 540
% 2.05/0.64
% 2.05/0.64 # -------------------------------------------------
% 2.05/0.64 # User time : 0.227 s
% 2.05/0.64 # System time : 0.010 s
% 2.05/0.64 # Total time : 0.237 s
% 2.05/0.64 # Maximum resident set size: 2136 pages
% 2.05/0.64
% 2.05/0.64 # -------------------------------------------------
% 2.05/0.64 # User time : 1.146 s
% 2.05/0.64 # System time : 0.040 s
% 2.05/0.64 # Total time : 1.185 s
% 2.05/0.64 # Maximum resident set size: 1880 pages
% 2.05/0.64 % E---3.1 exiting
% 2.05/0.64 % E exiting
%------------------------------------------------------------------------------