TSTP Solution File: SWC187-1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SWC187-1 : TPTP v8.2.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n006.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:24:15 EDT 2024
% Result : Unsatisfiable 0.19s 0.56s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 22
% Number of leaves : 21
% Syntax : Number of clauses : 83 ( 19 unt; 18 nHn; 83 RR)
% Number of literals : 204 ( 83 equ; 110 neg)
% Maximal clause size : 5 ( 2 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 7 con; 0-2 aty)
% Number of variables : 66 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(clause119,axiom,
( nil = X2
| app(X1,X2) != nil
| ~ ssList(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause119) ).
cnf(co1_10,negated_conjecture,
app(app(sk6,cons(sk5,nil)),sk7) = sk1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_10) ).
cnf(co1_6,negated_conjecture,
sk1 = sk3,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_6) ).
cnf(clause118,axiom,
( nil = X1
| app(X1,X2) != nil
| ~ ssList(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause118) ).
cnf(co1_9,negated_conjecture,
ssList(sk7),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_9) ).
cnf(clause85,axiom,
( ssList(app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause85) ).
cnf(co1_8,negated_conjecture,
ssList(sk6),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_8) ).
cnf(clause86,axiom,
( ssList(cons(X1,X2))
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause86) ).
cnf(co1_7,negated_conjecture,
ssItem(sk5),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_7) ).
cnf(clause8,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause8) ).
cnf(co1_11,negated_conjecture,
( memberP(sk6,sk5)
| memberP(sk7,sk5) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_11) ).
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(clause96,axiom,
( tl(cons(X1,X2)) = X2
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause96) ).
cnf(clause71,axiom,
( ~ memberP(nil,X1)
| ~ ssItem(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause71) ).
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_16,negated_conjecture,
( cons(sk8,nil) = sk3
| nil = sk3 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_16) ).
cnf(co1_13,negated_conjecture,
( ssItem(sk8)
| nil = sk3 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_13) ).
cnf(clause133,axiom,
( nil = X2
| tl(app(X2,X1)) = app(tl(X2),X1)
| ~ ssList(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause133) ).
cnf(clause98,axiom,
( cons(X1,X2) != nil
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause98) ).
cnf(clause75,axiom,
( ssList(tl(X1))
| nil = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause75) ).
cnf(clause74,axiom,
( app(nil,X1) = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause74) ).
cnf(c_0_21,plain,
( nil = X2
| app(X1,X2) != nil
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause119]) ).
cnf(c_0_22,negated_conjecture,
app(app(sk6,cons(sk5,nil)),sk7) = sk1,
co1_10 ).
cnf(c_0_23,negated_conjecture,
sk1 = sk3,
co1_6 ).
cnf(c_0_24,plain,
( nil = X1
| app(X1,X2) != nil
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause118]) ).
cnf(c_0_25,plain,
( nil = X2
| app(X1,X2) != nil
| ~ ssList(X2)
| ~ ssList(X1) ),
c_0_21 ).
cnf(c_0_26,negated_conjecture,
app(app(sk6,cons(sk5,nil)),sk7) = sk3,
inference(rw,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_27,negated_conjecture,
ssList(sk7),
co1_9 ).
cnf(c_0_28,plain,
( ssList(app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(fof_simplification,[status(thm)],[clause85]) ).
cnf(c_0_29,plain,
( nil = X1
| app(X1,X2) != nil
| ~ ssList(X2)
| ~ ssList(X1) ),
c_0_24 ).
cnf(c_0_30,negated_conjecture,
( sk7 = nil
| sk3 != nil
| ~ ssList(app(sk6,cons(sk5,nil))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_27])]) ).
cnf(c_0_31,plain,
( ssList(app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2) ),
c_0_28 ).
cnf(c_0_32,negated_conjecture,
ssList(sk6),
co1_8 ).
cnf(c_0_33,plain,
( ssList(cons(X1,X2))
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(fof_simplification,[status(thm)],[clause86]) ).
cnf(c_0_34,negated_conjecture,
( app(sk6,cons(sk5,nil)) = nil
| sk3 != nil
| ~ ssList(app(sk6,cons(sk5,nil))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_26]),c_0_27])]) ).
cnf(c_0_35,negated_conjecture,
( sk7 = nil
| sk3 != nil
| ~ ssList(cons(sk5,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_32])]) ).
cnf(c_0_36,plain,
( ssList(cons(X1,X2))
| ~ ssItem(X1)
| ~ ssList(X2) ),
c_0_33 ).
cnf(c_0_37,negated_conjecture,
ssItem(sk5),
co1_7 ).
cnf(c_0_38,axiom,
ssList(nil),
clause8 ).
cnf(c_0_39,negated_conjecture,
( app(sk6,cons(sk5,nil)) = nil
| sk3 != nil
| ~ ssList(cons(sk5,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_31]),c_0_32])]) ).
cnf(c_0_40,negated_conjecture,
( memberP(sk6,sk5)
| memberP(sk7,sk5) ),
co1_11 ).
cnf(c_0_41,negated_conjecture,
( sk7 = nil
| sk3 != nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),c_0_37]),c_0_38])]) ).
cnf(c_0_42,negated_conjecture,
( sk6 = nil
| sk3 != nil
| ~ ssList(cons(sk5,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_39]),c_0_32])]) ).
cnf(c_0_43,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_44,plain,
( tl(cons(X1,X2)) = X2
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(fof_simplification,[status(thm)],[clause96]) ).
cnf(c_0_45,plain,
( ~ memberP(nil,X1)
| ~ ssItem(X1) ),
inference(fof_simplification,[status(thm)],[clause71]) ).
cnf(c_0_46,negated_conjecture,
( memberP(nil,sk5)
| memberP(sk6,sk5)
| sk3 != nil ),
inference(spm,[status(thm)],[c_0_40,c_0_41]) ).
cnf(c_0_47,negated_conjecture,
( sk6 = nil
| sk3 != nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_36]),c_0_37]),c_0_38])]) ).
cnf(c_0_48,plain,
( app(app(X3,X2),X1) = app(X3,app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
c_0_43 ).
cnf(c_0_49,plain,
( app(cons(X1,nil),X2) = cons(X1,X2)
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(fof_simplification,[status(thm)],[clause120]) ).
cnf(c_0_50,plain,
( tl(cons(X1,X2)) = X2
| ~ ssItem(X1)
| ~ ssList(X2) ),
c_0_44 ).
cnf(c_0_51,negated_conjecture,
( cons(sk8,nil) = sk3
| nil = sk3 ),
co1_16 ).
cnf(c_0_52,negated_conjecture,
( ssItem(sk8)
| nil = sk3 ),
co1_13 ).
cnf(c_0_53,plain,
( ~ memberP(nil,X1)
| ~ ssItem(X1) ),
c_0_45 ).
cnf(c_0_54,negated_conjecture,
( memberP(nil,sk5)
| sk3 != nil ),
inference(spm,[status(thm)],[c_0_46,c_0_47]) ).
cnf(c_0_55,plain,
( nil = X2
| tl(app(X2,X1)) = app(tl(X2),X1)
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(fof_simplification,[status(thm)],[clause133]) ).
cnf(c_0_56,negated_conjecture,
( app(sk6,app(cons(sk5,nil),sk7)) = sk3
| ~ ssList(cons(sk5,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_48]),c_0_32]),c_0_27])]) ).
cnf(c_0_57,plain,
( app(cons(X1,nil),X2) = cons(X1,X2)
| ~ ssItem(X1)
| ~ ssList(X2) ),
c_0_49 ).
cnf(c_0_58,negated_conjecture,
( tl(sk3) = nil
| sk3 = nil ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_51]),c_0_38])]),c_0_52]) ).
cnf(c_0_59,negated_conjecture,
sk3 != nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_54]),c_0_37])]) ).
cnf(c_0_60,plain,
( nil = X2
| tl(app(X2,X1)) = app(tl(X2),X1)
| ~ ssList(X1)
| ~ ssList(X2) ),
c_0_55 ).
cnf(c_0_61,negated_conjecture,
( app(sk6,cons(sk5,sk7)) = sk3
| ~ ssList(cons(sk5,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_56,c_0_57]),c_0_37]),c_0_27])]) ).
cnf(c_0_62,negated_conjecture,
tl(sk3) = nil,
inference(sr,[status(thm)],[c_0_58,c_0_59]) ).
cnf(c_0_63,negated_conjecture,
( app(tl(sk6),cons(sk5,sk7)) = nil
| sk6 = nil
| ~ ssList(cons(sk5,sk7))
| ~ ssList(cons(sk5,nil)) ),
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_32])]) ).
cnf(c_0_64,plain,
( cons(X1,X2) != nil
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(fof_simplification,[status(thm)],[clause98]) ).
cnf(c_0_65,negated_conjecture,
( cons(sk5,sk7) = nil
| sk6 = nil
| ~ ssList(cons(sk5,sk7))
| ~ ssList(cons(sk5,nil))
| ~ ssList(tl(sk6)) ),
inference(spm,[status(thm)],[c_0_25,c_0_63]) ).
cnf(c_0_66,plain,
( cons(X1,X2) != nil
| ~ ssItem(X1)
| ~ ssList(X2) ),
c_0_64 ).
cnf(c_0_67,negated_conjecture,
( cons(sk5,sk7) = nil
| sk6 = nil
| ~ ssList(cons(sk5,nil))
| ~ ssList(tl(sk6)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_65,c_0_36]),c_0_37]),c_0_27])]) ).
cnf(c_0_68,plain,
( ssList(tl(X1))
| nil = X1
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause75]) ).
cnf(c_0_69,negated_conjecture,
( sk6 = nil
| ~ ssList(cons(sk5,nil))
| ~ ssList(tl(sk6)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_66,c_0_67]),c_0_37]),c_0_27])]) ).
cnf(c_0_70,plain,
( ssList(tl(X1))
| nil = X1
| ~ ssList(X1) ),
c_0_68 ).
cnf(c_0_71,negated_conjecture,
( sk6 = nil
| ~ ssList(cons(sk5,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_69,c_0_70]),c_0_32])]) ).
cnf(c_0_72,plain,
( app(nil,X1) = X1
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause74]) ).
cnf(c_0_73,negated_conjecture,
sk6 = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_71,c_0_36]),c_0_37]),c_0_38])]) ).
cnf(c_0_74,plain,
( app(nil,X1) = X1
| ~ ssList(X1) ),
c_0_72 ).
cnf(c_0_75,negated_conjecture,
( app(nil,cons(sk5,sk7)) = sk3
| ~ ssList(cons(sk5,nil)) ),
inference(rw,[status(thm)],[c_0_61,c_0_73]) ).
cnf(c_0_76,negated_conjecture,
( cons(sk5,sk7) = sk3
| ~ ssList(cons(sk5,sk7))
| ~ ssList(cons(sk5,nil)) ),
inference(spm,[status(thm)],[c_0_74,c_0_75]) ).
cnf(c_0_77,negated_conjecture,
( cons(sk5,sk7) = sk3
| ~ ssList(cons(sk5,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_76,c_0_36]),c_0_37]),c_0_27])]) ).
cnf(c_0_78,negated_conjecture,
( sk7 = nil
| ~ ssList(cons(sk5,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_77]),c_0_62]),c_0_37]),c_0_27])]) ).
cnf(c_0_79,negated_conjecture,
( memberP(sk7,sk5)
| memberP(nil,sk5) ),
inference(rw,[status(thm)],[c_0_40,c_0_73]) ).
cnf(c_0_80,negated_conjecture,
sk7 = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_78,c_0_36]),c_0_37]),c_0_38])]) ).
cnf(c_0_81,negated_conjecture,
memberP(nil,sk5),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_79,c_0_80])]) ).
cnf(c_0_82,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_81]),c_0_37])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SWC187-1 : TPTP v8.2.0. Released v2.4.0.
% 0.03/0.13 % Command : run_E %s %d THM
% 0.13/0.33 % Computer : n006.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 300
% 0.13/0.33 % DateTime : Sun May 19 03:50:38 EDT 2024
% 0.13/0.33 % CPUTime :
% 0.19/0.46 Running first-order theorem proving
% 0.19/0.46 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.19/0.56 # Version: 3.1.0
% 0.19/0.56 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.19/0.56 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.56 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.19/0.56 # Starting new_bool_3 with 300s (1) cores
% 0.19/0.56 # Starting new_bool_1 with 300s (1) cores
% 0.19/0.56 # Starting sh5l with 300s (1) cores
% 0.19/0.56 # C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 18262 completed with status 0
% 0.19/0.56 # Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.19/0.56 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.19/0.56 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.56 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.19/0.56 # No SInE strategy applied
% 0.19/0.56 # Search class: FGHSM-FSLM21-MFFFFFNN
% 0.19/0.56 # Scheduled 9 strats onto 5 cores with 1500 seconds (1500 total)
% 0.19/0.56 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2s with 406s (1) cores
% 0.19/0.56 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.19/0.56 # Starting G-E--_200_B02_F1_SE_CS_SP_PI_S2k with 136s (1) cores
% 0.19/0.56 # Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S04BN with 136s (1) cores
% 0.19/0.56 # Starting G-E--_200_B02_F1_SE_CS_SP_PI_S0S with 136s (1) cores
% 0.19/0.56 # C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 18275 completed with status 0
% 0.19/0.56 # Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.19/0.56 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.19/0.56 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.56 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.19/0.56 # No SInE strategy applied
% 0.19/0.56 # Search class: FGHSM-FSLM21-MFFFFFNN
% 0.19/0.56 # Scheduled 9 strats onto 5 cores with 1500 seconds (1500 total)
% 0.19/0.56 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2s with 406s (1) cores
% 0.19/0.56 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.19/0.56 # Preprocessing time : 0.003 s
% 0.19/0.56 # Presaturation interreduction done
% 0.19/0.56
% 0.19/0.56 # Proof found!
% 0.19/0.56 # SZS status Unsatisfiable
% 0.19/0.56 # SZS output start CNFRefutation
% See solution above
% 0.19/0.56 # Parsed axioms : 202
% 0.19/0.56 # Removed by relevancy pruning/SinE : 0
% 0.19/0.56 # Initial clauses : 202
% 0.19/0.56 # Removed in clause preprocessing : 0
% 0.19/0.56 # Initial clauses in saturation : 202
% 0.19/0.56 # Processed clauses : 615
% 0.19/0.56 # ...of these trivial : 12
% 0.19/0.56 # ...subsumed : 65
% 0.19/0.56 # ...remaining for further processing : 538
% 0.19/0.56 # Other redundant clauses eliminated : 74
% 0.19/0.56 # Clauses deleted for lack of memory : 0
% 0.19/0.56 # Backward-subsumed : 37
% 0.19/0.56 # Backward-rewritten : 22
% 0.19/0.56 # Generated clauses : 1389
% 0.19/0.56 # ...of the previous two non-redundant : 1210
% 0.19/0.56 # ...aggressively subsumed : 0
% 0.19/0.56 # Contextual simplify-reflections : 20
% 0.19/0.56 # Paramodulations : 1299
% 0.19/0.56 # Factorizations : 0
% 0.19/0.56 # NegExts : 0
% 0.19/0.56 # Equation resolutions : 79
% 0.19/0.56 # Disequality decompositions : 0
% 0.19/0.56 # Total rewrite steps : 1491
% 0.19/0.56 # ...of those cached : 1366
% 0.19/0.56 # Propositional unsat checks : 0
% 0.19/0.56 # Propositional check models : 0
% 0.19/0.56 # Propositional check unsatisfiable : 0
% 0.19/0.56 # Propositional clauses : 0
% 0.19/0.56 # Propositional clauses after purity: 0
% 0.19/0.56 # Propositional unsat core size : 0
% 0.19/0.56 # Propositional preprocessing time : 0.000
% 0.19/0.56 # Propositional encoding time : 0.000
% 0.19/0.56 # Propositional solver time : 0.000
% 0.19/0.56 # Success case prop preproc time : 0.000
% 0.19/0.56 # Success case prop encoding time : 0.000
% 0.19/0.56 # Success case prop solver time : 0.000
% 0.19/0.56 # Current number of processed clauses : 250
% 0.19/0.56 # Positive orientable unit clauses : 81
% 0.19/0.56 # Positive unorientable unit clauses: 0
% 0.19/0.56 # Negative unit clauses : 3
% 0.19/0.56 # Non-unit-clauses : 166
% 0.19/0.56 # Current number of unprocessed clauses: 975
% 0.19/0.56 # ...number of literals in the above : 5839
% 0.19/0.56 # Current number of archived formulas : 0
% 0.19/0.56 # Current number of archived clauses : 265
% 0.19/0.56 # Clause-clause subsumption calls (NU) : 16084
% 0.19/0.56 # Rec. Clause-clause subsumption calls : 2888
% 0.19/0.56 # Non-unit clause-clause subsumptions : 87
% 0.19/0.56 # Unit Clause-clause subsumption calls : 188
% 0.19/0.56 # Rewrite failures with RHS unbound : 0
% 0.19/0.56 # BW rewrite match attempts : 13
% 0.19/0.56 # BW rewrite match successes : 13
% 0.19/0.56 # Condensation attempts : 0
% 0.19/0.56 # Condensation successes : 0
% 0.19/0.56 # Termbank termtop insertions : 34526
% 0.19/0.56 # Search garbage collected termcells : 527
% 0.19/0.56
% 0.19/0.56 # -------------------------------------------------
% 0.19/0.56 # User time : 0.064 s
% 0.19/0.56 # System time : 0.006 s
% 0.19/0.56 # Total time : 0.070 s
% 0.19/0.56 # Maximum resident set size: 2144 pages
% 0.19/0.56
% 0.19/0.56 # -------------------------------------------------
% 0.19/0.56 # User time : 0.294 s
% 0.19/0.56 # System time : 0.031 s
% 0.19/0.56 # Total time : 0.324 s
% 0.19/0.56 # Maximum resident set size: 1876 pages
% 0.19/0.56 % E---3.1 exiting
% 0.19/0.56 % E exiting
%------------------------------------------------------------------------------