TSTP Solution File: SWC191+1 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : SWC191+1 : TPTP v8.2.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n003.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:13 EDT 2024
% Result : Theorem 0.38s 0.59s
% Output : CNFRefutation 0.38s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 7
% Syntax : Number of formulae : 44 ( 19 unt; 0 def)
% Number of atoms : 180 ( 45 equ)
% Maximal formula atoms : 26 ( 4 avg)
% Number of connectives : 208 ( 72 ~; 75 |; 28 &)
% ( 1 <=>; 32 =>; 0 <=; 0 <~>)
% Maximal formula depth : 25 ( 5 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-2 aty)
% Number of functors : 15 ( 15 usr; 9 con; 0-2 aty)
% Number of variables : 68 ( 0 sgn 47 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(co1,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ~ frontsegP(X4,X3)
| ~ equalelemsP(X3)
| ? [X5] :
( ssList(X5)
& neq(X3,X5)
& frontsegP(X4,X5)
& segmentP(X5,X3)
& equalelemsP(X5) )
| ! [X6] :
( ssItem(X6)
=> ! [X7] :
( ssItem(X7)
=> ! [X8] :
( ssList(X8)
=> ! [X9] :
( ssList(X9)
=> ( app(app(app(X8,cons(X6,nil)),cons(X7,nil)),X9) != X1
| X6 = X7 ) ) ) ) ) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).
fof(ax82,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> app(app(X1,X2),X3) = app(X1,app(X2,X3)) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax82) ).
fof(ax16,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> ssList(cons(X2,X1)) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax16) ).
fof(ax17,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax17) ).
fof(ax81,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> cons(X2,X1) = app(cons(X2,nil),X1) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax81) ).
fof(ax27,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssItem(X3)
=> cons(X3,app(X2,X1)) = app(cons(X3,X2),X1) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax27) ).
fof(ax14,axiom,
! [X1] :
( ssList(X1)
=> ( equalelemsP(X1)
<=> ! [X2] :
( ssItem(X2)
=> ! [X3] :
( ssItem(X3)
=> ! [X4] :
( ssList(X4)
=> ! [X5] :
( ssList(X5)
=> ( app(X4,cons(X2,cons(X3,X5))) = X1
=> X2 = X3 ) ) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax14) ).
fof(c_0_7,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ~ frontsegP(X4,X3)
| ~ equalelemsP(X3)
| ? [X5] :
( ssList(X5)
& neq(X3,X5)
& frontsegP(X4,X5)
& segmentP(X5,X3)
& equalelemsP(X5) )
| ! [X6] :
( ssItem(X6)
=> ! [X7] :
( ssItem(X7)
=> ! [X8] :
( ssList(X8)
=> ! [X9] :
( ssList(X9)
=> ( app(app(app(X8,cons(X6,nil)),cons(X7,nil)),X9) != X1
| X6 = X7 ) ) ) ) ) ) ) ) ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[co1])]) ).
fof(c_0_8,negated_conjecture,
! [X258] :
( ssList(esk48_0)
& ssList(esk49_0)
& ssList(esk50_0)
& ssList(esk51_0)
& esk49_0 = esk51_0
& esk48_0 = esk50_0
& frontsegP(esk51_0,esk50_0)
& equalelemsP(esk50_0)
& ( ~ ssList(X258)
| ~ neq(esk50_0,X258)
| ~ frontsegP(esk51_0,X258)
| ~ segmentP(X258,esk50_0)
| ~ equalelemsP(X258) )
& ssItem(esk52_0)
& ssItem(esk53_0)
& ssList(esk54_0)
& ssList(esk55_0)
& app(app(app(esk54_0,cons(esk52_0,nil)),cons(esk53_0,nil)),esk55_0) = esk48_0
& esk52_0 != esk53_0 ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_7])])])])]) ).
cnf(c_0_9,negated_conjecture,
app(app(app(esk54_0,cons(esk52_0,nil)),cons(esk53_0,nil)),esk55_0) = esk48_0,
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_10,negated_conjecture,
esk48_0 = esk50_0,
inference(split_conjunct,[status(thm)],[c_0_8]) ).
fof(c_0_11,plain,
! [X225,X226,X227] :
( ~ ssList(X225)
| ~ ssList(X226)
| ~ ssList(X227)
| app(app(X225,X226),X227) = app(X225,app(X226,X227)) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax82])])])]) ).
cnf(c_0_12,negated_conjecture,
app(app(app(esk54_0,cons(esk52_0,nil)),cons(esk53_0,nil)),esk55_0) = esk50_0,
inference(rw,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_13,plain,
( app(app(X1,X2),X3) = app(X1,app(X2,X3))
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_14,negated_conjecture,
ssList(esk54_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
fof(c_0_15,plain,
! [X114,X115] :
( ~ ssList(X114)
| ~ ssItem(X115)
| ssList(cons(X115,X114)) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax16])])])]) ).
cnf(c_0_16,negated_conjecture,
( app(app(esk54_0,app(cons(esk52_0,nil),cons(esk53_0,nil))),esk55_0) = esk50_0
| ~ ssList(cons(esk53_0,nil))
| ~ ssList(cons(esk52_0,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_14])]) ).
cnf(c_0_17,plain,
( ssList(cons(X2,X1))
| ~ ssList(X1)
| ~ ssItem(X2) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_18,plain,
ssList(nil),
inference(split_conjunct,[status(thm)],[ax17]) ).
cnf(c_0_19,negated_conjecture,
ssItem(esk53_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_20,negated_conjecture,
( app(app(esk54_0,app(cons(esk52_0,nil),cons(esk53_0,nil))),esk55_0) = esk50_0
| ~ ssList(cons(esk52_0,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_18]),c_0_19])]) ).
cnf(c_0_21,negated_conjecture,
ssItem(esk52_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
fof(c_0_22,plain,
! [X223,X224] :
( ~ ssList(X223)
| ~ ssItem(X224)
| cons(X224,X223) = app(cons(X224,nil),X223) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax81])])])]) ).
cnf(c_0_23,negated_conjecture,
app(app(esk54_0,app(cons(esk52_0,nil),cons(esk53_0,nil))),esk55_0) = esk50_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_17]),c_0_18]),c_0_21])]) ).
cnf(c_0_24,plain,
( cons(X2,X1) = app(cons(X2,nil),X1)
| ~ ssList(X1)
| ~ ssItem(X2) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_25,negated_conjecture,
( app(app(esk54_0,cons(esk52_0,cons(esk53_0,nil))),esk55_0) = esk50_0
| ~ ssList(cons(esk53_0,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_21])]) ).
cnf(c_0_26,negated_conjecture,
app(app(esk54_0,cons(esk52_0,cons(esk53_0,nil))),esk55_0) = esk50_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_17]),c_0_18]),c_0_19])]) ).
cnf(c_0_27,negated_conjecture,
ssList(esk55_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_28,negated_conjecture,
( app(esk54_0,app(cons(esk52_0,cons(esk53_0,nil)),esk55_0)) = esk50_0
| ~ ssList(cons(esk52_0,cons(esk53_0,nil))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_26]),c_0_27]),c_0_14])]) ).
cnf(c_0_29,negated_conjecture,
( app(esk54_0,app(cons(esk52_0,cons(esk53_0,nil)),esk55_0)) = esk50_0
| ~ ssList(cons(esk53_0,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_17]),c_0_21])]) ).
fof(c_0_30,plain,
! [X135,X136,X137] :
( ~ ssList(X135)
| ~ ssList(X136)
| ~ ssItem(X137)
| cons(X137,app(X136,X135)) = app(cons(X137,X136),X135) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax27])])])]) ).
cnf(c_0_31,negated_conjecture,
app(esk54_0,app(cons(esk52_0,cons(esk53_0,nil)),esk55_0)) = esk50_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_17]),c_0_18]),c_0_19])]) ).
cnf(c_0_32,plain,
( cons(X3,app(X2,X1)) = app(cons(X3,X2),X1)
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssItem(X3) ),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
fof(c_0_33,plain,
! [X103,X104,X105,X106,X107] :
( ( ~ equalelemsP(X103)
| ~ ssItem(X104)
| ~ ssItem(X105)
| ~ ssList(X106)
| ~ ssList(X107)
| app(X106,cons(X104,cons(X105,X107))) != X103
| X104 = X105
| ~ ssList(X103) )
& ( ssItem(esk40_1(X103))
| equalelemsP(X103)
| ~ ssList(X103) )
& ( ssItem(esk41_1(X103))
| equalelemsP(X103)
| ~ ssList(X103) )
& ( ssList(esk42_1(X103))
| equalelemsP(X103)
| ~ ssList(X103) )
& ( ssList(esk43_1(X103))
| equalelemsP(X103)
| ~ ssList(X103) )
& ( app(esk42_1(X103),cons(esk40_1(X103),cons(esk41_1(X103),esk43_1(X103)))) = X103
| equalelemsP(X103)
| ~ ssList(X103) )
& ( esk40_1(X103) != esk41_1(X103)
| equalelemsP(X103)
| ~ ssList(X103) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax14])])])])])]) ).
cnf(c_0_34,negated_conjecture,
( app(esk54_0,cons(esk52_0,app(cons(esk53_0,nil),esk55_0))) = esk50_0
| ~ ssList(cons(esk53_0,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_27]),c_0_21])]) ).
cnf(c_0_35,plain,
( X2 = X3
| ~ equalelemsP(X1)
| ~ ssItem(X2)
| ~ ssItem(X3)
| ~ ssList(X4)
| ~ ssList(X5)
| app(X4,cons(X2,cons(X3,X5))) != X1
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_33]) ).
cnf(c_0_36,negated_conjecture,
app(esk54_0,cons(esk52_0,app(cons(esk53_0,nil),esk55_0))) = esk50_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_17]),c_0_18]),c_0_19])]) ).
cnf(c_0_37,negated_conjecture,
ssList(esk48_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_38,plain,
( X1 = X2
| ~ equalelemsP(app(X3,cons(X1,cons(X2,X4))))
| ~ ssList(app(X3,cons(X1,cons(X2,X4))))
| ~ ssList(X4)
| ~ ssList(X3)
| ~ ssItem(X2)
| ~ ssItem(X1) ),
inference(er,[status(thm)],[c_0_35]) ).
cnf(c_0_39,negated_conjecture,
app(esk54_0,cons(esk52_0,cons(esk53_0,esk55_0))) = esk50_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_24]),c_0_27]),c_0_19])]) ).
cnf(c_0_40,negated_conjecture,
equalelemsP(esk50_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_41,negated_conjecture,
ssList(esk50_0),
inference(rw,[status(thm)],[c_0_37,c_0_10]) ).
cnf(c_0_42,negated_conjecture,
esk52_0 != esk53_0,
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_43,negated_conjecture,
$false,
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(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_39]),c_0_40]),c_0_41]),c_0_27]),c_0_14]),c_0_19]),c_0_21])]),c_0_42]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.14 % Problem : SWC191+1 : TPTP v8.2.0. Released v2.4.0.
% 0.04/0.15 % Command : run_E %s %d THM
% 0.15/0.36 % Computer : n003.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 300
% 0.15/0.36 % DateTime : Sun May 19 03:18:53 EDT 2024
% 0.15/0.36 % CPUTime :
% 0.21/0.51 Running first-order model finding
% 0.21/0.51 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.38/0.59 # Version: 3.1.0
% 0.38/0.59 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.38/0.59 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.38/0.59 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.38/0.59 # Starting new_bool_3 with 300s (1) cores
% 0.38/0.59 # Starting new_bool_1 with 300s (1) cores
% 0.38/0.59 # Starting sh5l with 300s (1) cores
% 0.38/0.59 # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 29162 completed with status 0
% 0.38/0.59 # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.38/0.59 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.38/0.59 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.38/0.59 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.38/0.59 # No SInE strategy applied
% 0.38/0.59 # Search class: FGHSF-FSLM21-MFFFFFNN
% 0.38/0.59 # Scheduled 11 strats onto 5 cores with 1500 seconds (1500 total)
% 0.38/0.59 # Starting G-E--_208_C18_SOS_F1_SE_CS_SP_PS_S4c with 136s (1) cores
% 0.38/0.59 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.38/0.59 # Starting G-E--_110_C45_F1_PI_SE_CS_SP_PS_S4S with 136s (1) cores
% 0.38/0.59 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_TT_S0Y with 136s (1) cores
% 0.38/0.59 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2o with 136s (1) cores
% 0.38/0.59 # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 29170 completed with status 0
% 0.38/0.59 # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.38/0.59 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.38/0.59 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.38/0.59 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.38/0.59 # No SInE strategy applied
% 0.38/0.59 # Search class: FGHSF-FSLM21-MFFFFFNN
% 0.38/0.59 # Scheduled 11 strats onto 5 cores with 1500 seconds (1500 total)
% 0.38/0.59 # Starting G-E--_208_C18_SOS_F1_SE_CS_SP_PS_S4c with 136s (1) cores
% 0.38/0.59 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.38/0.59 # Preprocessing time : 0.003 s
% 0.38/0.59 # Presaturation interreduction done
% 0.38/0.59
% 0.38/0.59 # Proof found!
% 0.38/0.59 # SZS status Theorem
% 0.38/0.59 # SZS output start CNFRefutation
% See solution above
% 0.38/0.59 # Parsed axioms : 96
% 0.38/0.59 # Removed by relevancy pruning/SinE : 0
% 0.38/0.59 # Initial clauses : 205
% 0.38/0.59 # Removed in clause preprocessing : 2
% 0.38/0.59 # Initial clauses in saturation : 203
% 0.38/0.59 # Processed clauses : 531
% 0.38/0.59 # ...of these trivial : 2
% 0.38/0.59 # ...subsumed : 41
% 0.38/0.59 # ...remaining for further processing : 488
% 0.38/0.59 # Other redundant clauses eliminated : 62
% 0.38/0.59 # Clauses deleted for lack of memory : 0
% 0.38/0.59 # Backward-subsumed : 6
% 0.38/0.59 # Backward-rewritten : 12
% 0.38/0.59 # Generated clauses : 846
% 0.38/0.59 # ...of the previous two non-redundant : 738
% 0.38/0.59 # ...aggressively subsumed : 0
% 0.38/0.59 # Contextual simplify-reflections : 26
% 0.38/0.59 # Paramodulations : 781
% 0.38/0.59 # Factorizations : 0
% 0.38/0.59 # NegExts : 0
% 0.38/0.59 # Equation resolutions : 67
% 0.38/0.59 # Disequality decompositions : 0
% 0.38/0.59 # Total rewrite steps : 481
% 0.38/0.59 # ...of those cached : 452
% 0.38/0.59 # Propositional unsat checks : 0
% 0.38/0.59 # Propositional check models : 0
% 0.38/0.59 # Propositional check unsatisfiable : 0
% 0.38/0.59 # Propositional clauses : 0
% 0.38/0.59 # Propositional clauses after purity: 0
% 0.38/0.59 # Propositional unsat core size : 0
% 0.38/0.59 # Propositional preprocessing time : 0.000
% 0.38/0.59 # Propositional encoding time : 0.000
% 0.38/0.59 # Propositional solver time : 0.000
% 0.38/0.59 # Success case prop preproc time : 0.000
% 0.38/0.59 # Success case prop encoding time : 0.000
% 0.38/0.59 # Success case prop solver time : 0.000
% 0.38/0.59 # Current number of processed clauses : 250
% 0.38/0.59 # Positive orientable unit clauses : 40
% 0.38/0.59 # Positive unorientable unit clauses: 0
% 0.38/0.59 # Negative unit clauses : 4
% 0.38/0.59 # Non-unit-clauses : 206
% 0.38/0.59 # Current number of unprocessed clauses: 585
% 0.38/0.59 # ...number of literals in the above : 3620
% 0.38/0.59 # Current number of archived formulas : 0
% 0.38/0.59 # Current number of archived clauses : 215
% 0.38/0.59 # Clause-clause subsumption calls (NU) : 18651
% 0.38/0.59 # Rec. Clause-clause subsumption calls : 4095
% 0.38/0.59 # Non-unit clause-clause subsumptions : 52
% 0.38/0.59 # Unit Clause-clause subsumption calls : 49
% 0.38/0.59 # Rewrite failures with RHS unbound : 0
% 0.38/0.59 # BW rewrite match attempts : 9
% 0.38/0.59 # BW rewrite match successes : 7
% 0.38/0.59 # Condensation attempts : 0
% 0.38/0.59 # Condensation successes : 0
% 0.38/0.59 # Termbank termtop insertions : 36795
% 0.38/0.59 # Search garbage collected termcells : 4358
% 0.38/0.59
% 0.38/0.59 # -------------------------------------------------
% 0.38/0.59 # User time : 0.059 s
% 0.38/0.59 # System time : 0.005 s
% 0.38/0.59 # Total time : 0.064 s
% 0.38/0.59 # Maximum resident set size: 2480 pages
% 0.38/0.59
% 0.38/0.59 # -------------------------------------------------
% 0.38/0.59 # User time : 0.228 s
% 0.38/0.59 # System time : 0.023 s
% 0.38/0.59 # Total time : 0.251 s
% 0.38/0.59 # Maximum resident set size: 1828 pages
% 0.38/0.59 % E---3.1 exiting
%------------------------------------------------------------------------------