TSTP Solution File: SWC382-1 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : SWC382-1 : TPTP v8.2.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n022.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:29:23 EDT 2024
% Result : Unsatisfiable 2.51s 0.76s
% Output : CNFRefutation 2.51s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 21
% Syntax : Number of clauses : 80 ( 21 unt; 22 nHn; 76 RR)
% Number of literals : 222 ( 66 equ; 128 neg)
% Maximal clause size : 7 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 5 con; 0-2 aty)
% Number of variables : 85 ( 4 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(co1_7,negated_conjecture,
( neq(sk2,nil)
| neq(sk2,nil) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_7) ).
cnf(co1_11,negated_conjecture,
( sk3 = X1
| ~ ssList(X1)
| ~ ssItem(X2)
| cons(X2,nil) != X1
| hd(sk4) != X2
| ~ neq(nil,sk4)
| ~ neq(sk4,nil) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_11) ).
cnf(co1_5,negated_conjecture,
sk2 = sk4,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_5) ).
cnf(co1_6,negated_conjecture,
sk1 = sk3,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_6) ).
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(clause8,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause8) ).
cnf(clause76,axiom,
( ssItem(hd(X1))
| nil = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause76) ).
cnf(clause86,axiom,
( ssList(cons(X1,X2))
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause86) ).
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(clause97,axiom,
( hd(cons(X1,X2)) = X1
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause97) ).
cnf(clause109,axiom,
( cons(skaf83(X1),skaf82(X1)) = X1
| nil = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause109) ).
cnf(clause116,axiom,
( singletonP(X2)
| cons(X1,nil) != X2
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause116) ).
cnf(clause173,axiom,
( segmentP(X4,X2)
| app(app(X1,X2),X3) != X4
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X4) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause173) ).
cnf(clause12,axiom,
ssItem(skaf83(X1)),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause12) ).
cnf(clause13,axiom,
ssList(skaf82(X1)),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause13) ).
cnf(clause74,axiom,
( app(nil,X1) = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause74) ).
cnf(clause85,axiom,
( ssList(app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause85) ).
cnf(co1_12,negated_conjecture,
( ~ singletonP(sk1)
| ~ segmentP(sk2,sk1)
| ~ neq(sk4,nil) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_12) ).
cnf(co1_1,negated_conjecture,
ssList(sk1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_1) ).
cnf(clause115,axiom,
( X1 != X2
| ~ neq(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause115) ).
cnf(c_0_21,negated_conjecture,
neq(sk2,nil),
inference(fof_simplification,[status(thm)],[co1_7]) ).
cnf(c_0_22,negated_conjecture,
( sk3 = X1
| ~ ssList(X1)
| ~ ssItem(X2)
| cons(X2,nil) != X1
| hd(sk4) != X2
| ~ neq(nil,sk4)
| ~ neq(sk4,nil) ),
inference(fof_simplification,[status(thm)],[co1_11]) ).
cnf(c_0_23,negated_conjecture,
neq(sk2,nil),
c_0_21 ).
cnf(c_0_24,negated_conjecture,
sk2 = sk4,
co1_5 ).
cnf(c_0_25,negated_conjecture,
( sk3 = X1
| ~ ssList(X1)
| ~ ssItem(X2)
| cons(X2,nil) != X1
| hd(sk4) != X2
| ~ neq(nil,sk4)
| ~ neq(sk4,nil) ),
c_0_22 ).
cnf(c_0_26,negated_conjecture,
sk1 = sk3,
co1_6 ).
cnf(c_0_27,negated_conjecture,
neq(sk4,nil),
inference(rw,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_28,plain,
( neq(X2,X1)
| X2 = X1
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(fof_simplification,[status(thm)],[clause100]) ).
cnf(c_0_29,negated_conjecture,
ssList(sk2),
co1_2 ).
cnf(c_0_30,negated_conjecture,
( cons(hd(sk4),nil) = sk1
| ~ neq(nil,sk4)
| ~ ssItem(hd(sk4))
| ~ ssList(cons(hd(sk4),nil)) ),
inference(er,[status(thm)],[inference(er,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_25,c_0_26]),c_0_27])])])]) ).
cnf(c_0_31,plain,
( neq(X2,X1)
| X2 = X1
| ~ ssList(X1)
| ~ ssList(X2) ),
c_0_28 ).
cnf(c_0_32,axiom,
ssList(nil),
clause8 ).
cnf(c_0_33,negated_conjecture,
ssList(sk4),
inference(rw,[status(thm)],[c_0_29,c_0_24]) ).
cnf(c_0_34,plain,
( ssItem(hd(X1))
| nil = X1
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause76]) ).
cnf(c_0_35,negated_conjecture,
( cons(hd(sk4),nil) = sk1
| sk4 = nil
| ~ ssItem(hd(sk4))
| ~ ssList(cons(hd(sk4),nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_32]),c_0_33])]) ).
cnf(c_0_36,plain,
( ssItem(hd(X1))
| nil = X1
| ~ ssList(X1) ),
c_0_34 ).
cnf(c_0_37,plain,
( ssList(cons(X1,X2))
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(fof_simplification,[status(thm)],[clause86]) ).
cnf(c_0_38,negated_conjecture,
( cons(hd(sk4),nil) = sk1
| sk4 = nil
| ~ ssList(cons(hd(sk4),nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),c_0_33])]) ).
cnf(c_0_39,plain,
( ssList(cons(X1,X2))
| ~ ssItem(X1)
| ~ ssList(X2) ),
c_0_37 ).
cnf(c_0_40,plain,
( app(cons(X1,nil),X2) = cons(X1,X2)
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(fof_simplification,[status(thm)],[clause120]) ).
cnf(c_0_41,negated_conjecture,
( cons(hd(sk4),nil) = sk1
| sk4 = nil
| ~ ssItem(hd(sk4)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_39]),c_0_32])]) ).
cnf(c_0_42,plain,
( hd(cons(X1,X2)) = X1
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(fof_simplification,[status(thm)],[clause97]) ).
cnf(c_0_43,plain,
( cons(skaf83(X1),skaf82(X1)) = X1
| nil = X1
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause109]) ).
cnf(c_0_44,plain,
( singletonP(X2)
| cons(X1,nil) != X2
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(fof_simplification,[status(thm)],[clause116]) ).
cnf(c_0_45,plain,
( segmentP(X4,X2)
| app(app(X1,X2),X3) != X4
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X4) ),
inference(fof_simplification,[status(thm)],[clause173]) ).
cnf(c_0_46,plain,
( app(cons(X1,nil),X2) = cons(X1,X2)
| ~ ssItem(X1)
| ~ ssList(X2) ),
c_0_40 ).
cnf(c_0_47,negated_conjecture,
( cons(hd(sk4),nil) = sk1
| sk4 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_36]),c_0_33])]) ).
cnf(c_0_48,plain,
( hd(cons(X1,X2)) = X1
| ~ ssItem(X1)
| ~ ssList(X2) ),
c_0_42 ).
cnf(c_0_49,plain,
( cons(skaf83(X1),skaf82(X1)) = X1
| nil = X1
| ~ ssList(X1) ),
c_0_43 ).
cnf(c_0_50,axiom,
ssItem(skaf83(X1)),
clause12 ).
cnf(c_0_51,axiom,
ssList(skaf82(X1)),
clause13 ).
cnf(c_0_52,plain,
( singletonP(X2)
| cons(X1,nil) != X2
| ~ ssItem(X1)
| ~ ssList(X2) ),
c_0_44 ).
cnf(c_0_53,plain,
( segmentP(X4,X2)
| app(app(X1,X2),X3) != X4
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X4) ),
c_0_45 ).
cnf(c_0_54,plain,
( app(nil,X1) = X1
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause74]) ).
cnf(c_0_55,plain,
( ssList(app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(fof_simplification,[status(thm)],[clause85]) ).
cnf(c_0_56,negated_conjecture,
( cons(hd(sk4),X1) = app(sk1,X1)
| sk4 = nil
| ~ ssItem(hd(sk4))
| ~ ssList(X1) ),
inference(spm,[status(thm)],[c_0_46,c_0_47]) ).
cnf(c_0_57,plain,
( skaf83(X1) = hd(X1)
| nil = X1
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_49]),c_0_50]),c_0_51])]) ).
cnf(c_0_58,plain,
( singletonP(cons(X1,nil))
| ~ ssItem(X1)
| ~ ssList(cons(X1,nil)) ),
inference(er,[status(thm)],[c_0_52]) ).
cnf(c_0_59,negated_conjecture,
( ~ singletonP(sk1)
| ~ segmentP(sk2,sk1)
| ~ neq(sk4,nil) ),
inference(fof_simplification,[status(thm)],[co1_12]) ).
cnf(c_0_60,plain,
( segmentP(app(app(X1,X2),X3),X2)
| ~ ssList(app(app(X1,X2),X3))
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(er,[status(thm)],[c_0_53]) ).
cnf(c_0_61,plain,
( app(nil,X1) = X1
| ~ ssList(X1) ),
c_0_54 ).
cnf(c_0_62,plain,
( ssList(app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2) ),
c_0_55 ).
cnf(c_0_63,negated_conjecture,
( cons(hd(sk4),X1) = app(sk1,X1)
| sk4 = nil
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_56,c_0_36]),c_0_33])]) ).
cnf(c_0_64,plain,
( cons(hd(X1),skaf82(X1)) = X1
| nil = X1
| ~ ssList(X1) ),
inference(spm,[status(thm)],[c_0_49,c_0_57]) ).
cnf(c_0_65,plain,
( singletonP(cons(X1,nil))
| ~ ssItem(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_58,c_0_39]),c_0_32])]) ).
cnf(c_0_66,negated_conjecture,
( ~ singletonP(sk1)
| ~ segmentP(sk2,sk1)
| ~ neq(sk4,nil) ),
c_0_59 ).
cnf(c_0_67,plain,
( segmentP(app(X1,X2),X1)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_60,c_0_61]),c_0_32])]),c_0_62]) ).
cnf(c_0_68,negated_conjecture,
( app(sk1,skaf82(sk4)) = sk4
| sk4 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_63,c_0_64]),c_0_51]),c_0_33])]) ).
cnf(c_0_69,negated_conjecture,
ssList(sk1),
co1_1 ).
cnf(c_0_70,negated_conjecture,
( sk4 = nil
| singletonP(sk1)
| ~ ssItem(hd(sk4)) ),
inference(spm,[status(thm)],[c_0_65,c_0_47]) ).
cnf(c_0_71,plain,
( X1 != X2
| ~ neq(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause115]) ).
cnf(c_0_72,negated_conjecture,
( ~ segmentP(sk4,sk1)
| ~ singletonP(sk1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_66,c_0_24]),c_0_27])]) ).
cnf(c_0_73,negated_conjecture,
( sk4 = nil
| segmentP(sk4,sk1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_67,c_0_68]),c_0_51]),c_0_69])]) ).
cnf(c_0_74,negated_conjecture,
( sk4 = nil
| singletonP(sk1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_70,c_0_36]),c_0_33])]) ).
cnf(c_0_75,plain,
( X1 != X2
| ~ neq(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
c_0_71 ).
cnf(c_0_76,negated_conjecture,
sk4 = nil,
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_72,c_0_73]),c_0_74]) ).
cnf(c_0_77,plain,
( ~ neq(X1,X1)
| ~ ssList(X1) ),
inference(er,[status(thm)],[c_0_75]) ).
cnf(c_0_78,negated_conjecture,
neq(nil,nil),
inference(rw,[status(thm)],[c_0_27,c_0_76]) ).
cnf(c_0_79,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_77,c_0_78]),c_0_32])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : SWC382-1 : TPTP v8.2.0. Released v2.4.0.
% 0.06/0.13 % Command : run_E %s %d THM
% 0.13/0.33 % Computer : n022.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:26:23 EDT 2024
% 0.13/0.34 % CPUTime :
% 0.20/0.46 Running first-order model finding
% 0.20/0.46 Running: /export/starexec/sandbox/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/sandbox/benchmark/theBenchmark.p
% 2.51/0.76 # Version: 3.1.0
% 2.51/0.76 # Preprocessing class: FSLSSMSSSSSNFFN.
% 2.51/0.76 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.51/0.76 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 2.51/0.76 # Starting new_bool_3 with 300s (1) cores
% 2.51/0.76 # Starting new_bool_1 with 300s (1) cores
% 2.51/0.76 # Starting sh5l with 300s (1) cores
% 2.51/0.76 # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 31515 completed with status 0
% 2.51/0.76 # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 2.51/0.76 # Preprocessing class: FSLSSMSSSSSNFFN.
% 2.51/0.76 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.51/0.76 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 2.51/0.76 # No SInE strategy applied
% 2.51/0.76 # Search class: FGHSM-FSLM21-MFFFFFNN
% 2.51/0.76 # Scheduled 9 strats onto 5 cores with 1500 seconds (1500 total)
% 2.51/0.76 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2s with 406s (1) cores
% 2.51/0.76 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 2.51/0.76 # Starting G-E--_200_B02_F1_SE_CS_SP_PI_S2k with 136s (1) cores
% 2.51/0.76 # Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S04BN with 136s (1) cores
% 2.51/0.76 # Starting G-E--_200_B02_F1_SE_CS_SP_PI_S0S with 136s (1) cores
% 2.51/0.76 # G-E--_208_C18_F1_SE_CS_SP_PS_S2s with pid 31521 completed with status 0
% 2.51/0.76 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S2s
% 2.51/0.76 # Preprocessing class: FSLSSMSSSSSNFFN.
% 2.51/0.76 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.51/0.76 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 2.51/0.76 # No SInE strategy applied
% 2.51/0.76 # Search class: FGHSM-FSLM21-MFFFFFNN
% 2.51/0.76 # Scheduled 9 strats onto 5 cores with 1500 seconds (1500 total)
% 2.51/0.76 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2s with 406s (1) cores
% 2.51/0.76 # Preprocessing time : 0.003 s
% 2.51/0.76 # Presaturation interreduction done
% 2.51/0.76
% 2.51/0.76 # Proof found!
% 2.51/0.76 # SZS status Unsatisfiable
% 2.51/0.76 # SZS output start CNFRefutation
% See solution above
% 2.51/0.76 # Parsed axioms : 197
% 2.51/0.76 # Removed by relevancy pruning/SinE : 0
% 2.51/0.76 # Initial clauses : 197
% 2.51/0.76 # Removed in clause preprocessing : 0
% 2.51/0.76 # Initial clauses in saturation : 197
% 2.51/0.76 # Processed clauses : 3351
% 2.51/0.76 # ...of these trivial : 7
% 2.51/0.76 # ...subsumed : 2304
% 2.51/0.76 # ...remaining for further processing : 1040
% 2.51/0.76 # Other redundant clauses eliminated : 221
% 2.51/0.76 # Clauses deleted for lack of memory : 0
% 2.51/0.76 # Backward-subsumed : 73
% 2.51/0.76 # Backward-rewritten : 284
% 2.51/0.76 # Generated clauses : 13154
% 2.51/0.76 # ...of the previous two non-redundant : 12433
% 2.51/0.76 # ...aggressively subsumed : 0
% 2.51/0.76 # Contextual simplify-reflections : 348
% 2.51/0.76 # Paramodulations : 12925
% 2.51/0.76 # Factorizations : 0
% 2.51/0.76 # NegExts : 0
% 2.51/0.76 # Equation resolutions : 231
% 2.51/0.76 # Disequality decompositions : 0
% 2.51/0.76 # Total rewrite steps : 10587
% 2.51/0.76 # ...of those cached : 10320
% 2.51/0.76 # Propositional unsat checks : 0
% 2.51/0.76 # Propositional check models : 0
% 2.51/0.76 # Propositional check unsatisfiable : 0
% 2.51/0.76 # Propositional clauses : 0
% 2.51/0.76 # Propositional clauses after purity: 0
% 2.51/0.76 # Propositional unsat core size : 0
% 2.51/0.76 # Propositional preprocessing time : 0.000
% 2.51/0.76 # Propositional encoding time : 0.000
% 2.51/0.76 # Propositional solver time : 0.000
% 2.51/0.76 # Success case prop preproc time : 0.000
% 2.51/0.76 # Success case prop encoding time : 0.000
% 2.51/0.76 # Success case prop solver time : 0.000
% 2.51/0.76 # Current number of processed clauses : 473
% 2.51/0.76 # Positive orientable unit clauses : 65
% 2.51/0.76 # Positive unorientable unit clauses: 0
% 2.51/0.76 # Negative unit clauses : 2
% 2.51/0.76 # Non-unit-clauses : 406
% 2.51/0.76 # Current number of unprocessed clauses: 9358
% 2.51/0.76 # ...number of literals in the above : 54628
% 2.51/0.76 # Current number of archived formulas : 0
% 2.51/0.76 # Current number of archived clauses : 543
% 2.51/0.76 # Clause-clause subsumption calls (NU) : 108107
% 2.51/0.76 # Rec. Clause-clause subsumption calls : 35789
% 2.51/0.76 # Non-unit clause-clause subsumptions : 2450
% 2.51/0.76 # Unit Clause-clause subsumption calls : 512
% 2.51/0.76 # Rewrite failures with RHS unbound : 0
% 2.51/0.76 # BW rewrite match attempts : 6
% 2.51/0.76 # BW rewrite match successes : 6
% 2.51/0.76 # Condensation attempts : 0
% 2.51/0.76 # Condensation successes : 0
% 2.51/0.76 # Termbank termtop insertions : 258193
% 2.51/0.76 # Search garbage collected termcells : 555
% 2.51/0.76
% 2.51/0.76 # -------------------------------------------------
% 2.51/0.76 # User time : 0.275 s
% 2.51/0.76 # System time : 0.009 s
% 2.51/0.76 # Total time : 0.284 s
% 2.51/0.76 # Maximum resident set size: 2148 pages
% 2.51/0.76
% 2.51/0.76 # -------------------------------------------------
% 2.51/0.76 # User time : 1.357 s
% 2.51/0.76 # System time : 0.051 s
% 2.51/0.76 # Total time : 1.408 s
% 2.51/0.76 # Maximum resident set size: 1872 pages
% 2.51/0.76 % E---3.1 exiting
%------------------------------------------------------------------------------