TSTP Solution File: SWC305+1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : SWC305+1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n025.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 : 2400s
% WCLimit : 300s
% DateTime : Tue Oct 10 19:42:29 EDT 2023
% Result : Theorem 0.18s 0.53s
% Output : CNFRefutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 8
% Syntax : Number of formulae : 47 ( 17 unt; 0 def)
% Number of atoms : 208 ( 26 equ)
% Maximal formula atoms : 30 ( 4 avg)
% Number of connectives : 256 ( 95 ~; 90 |; 30 &)
% ( 1 <=>; 40 =>; 0 <=; 0 <~>)
% Maximal formula depth : 27 ( 5 avg)
% Maximal term depth : 6 ( 1 avg)
% Number of predicates : 9 ( 7 usr; 1 prp; 0-2 aty)
% Number of functors : 17 ( 17 usr; 10 con; 0-2 aty)
% Number of variables : 79 ( 0 sgn; 55 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(co1,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ~ frontsegP(X4,X3)
| ~ strictorderedP(X3)
| ? [X5] :
( ssList(X5)
& neq(X3,X5)
& frontsegP(X4,X5)
& segmentP(X5,X3)
& strictorderedP(X5) )
| ! [X6] :
( ssItem(X6)
=> ! [X7] :
( ssItem(X7)
=> ! [X8] :
( ssList(X8)
=> ! [X9] :
( ssList(X9)
=> ! [X10] :
( ssList(X10)
=> ( app(app(app(app(X8,cons(X6,nil)),X9),cons(X7,nil)),X10) != X1
| ~ lt(X7,X6) ) ) ) ) ) ) ) ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.JwAgXm4pAE/E---3.1_22925.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/tmp/tmp.JwAgXm4pAE/E---3.1_22925.p',ax82) ).
fof(ax81,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> cons(X2,X1) = app(cons(X2,nil),X1) ) ),
file('/export/starexec/sandbox2/tmp/tmp.JwAgXm4pAE/E---3.1_22925.p',ax81) ).
fof(ax33,axiom,
! [X1] :
( ssItem(X1)
=> ! [X2] :
( ssItem(X2)
=> ( lt(X1,X2)
=> ~ lt(X2,X1) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.JwAgXm4pAE/E---3.1_22925.p',ax33) ).
fof(ax12,axiom,
! [X1] :
( ssList(X1)
=> ( strictorderedP(X1)
<=> ! [X2] :
( ssItem(X2)
=> ! [X3] :
( ssItem(X3)
=> ! [X4] :
( ssList(X4)
=> ! [X5] :
( ssList(X5)
=> ! [X6] :
( ssList(X6)
=> ( app(app(X4,cons(X2,X5)),cons(X3,X6)) = X1
=> lt(X2,X3) ) ) ) ) ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.JwAgXm4pAE/E---3.1_22925.p',ax12) ).
fof(ax26,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ssList(app(X1,X2)) ) ),
file('/export/starexec/sandbox2/tmp/tmp.JwAgXm4pAE/E---3.1_22925.p',ax26) ).
fof(ax16,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> ssList(cons(X2,X1)) ) ),
file('/export/starexec/sandbox2/tmp/tmp.JwAgXm4pAE/E---3.1_22925.p',ax16) ).
fof(ax17,axiom,
ssList(nil),
file('/export/starexec/sandbox2/tmp/tmp.JwAgXm4pAE/E---3.1_22925.p',ax17) ).
fof(c_0_8,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ~ frontsegP(X4,X3)
| ~ strictorderedP(X3)
| ? [X5] :
( ssList(X5)
& neq(X3,X5)
& frontsegP(X4,X5)
& segmentP(X5,X3)
& strictorderedP(X5) )
| ! [X6] :
( ssItem(X6)
=> ! [X7] :
( ssItem(X7)
=> ! [X8] :
( ssList(X8)
=> ! [X9] :
( ssList(X9)
=> ! [X10] :
( ssList(X10)
=> ( app(app(app(app(X8,cons(X6,nil)),X9),cons(X7,nil)),X10) != X1
| ~ lt(X7,X6) ) ) ) ) ) ) ) ) ) ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[co1])]) ).
fof(c_0_9,negated_conjecture,
! [X15] :
( ssList(esk1_0)
& ssList(esk2_0)
& ssList(esk3_0)
& ssList(esk4_0)
& esk2_0 = esk4_0
& esk1_0 = esk3_0
& frontsegP(esk4_0,esk3_0)
& strictorderedP(esk3_0)
& ( ~ ssList(X15)
| ~ neq(esk3_0,X15)
| ~ frontsegP(esk4_0,X15)
| ~ segmentP(X15,esk3_0)
| ~ strictorderedP(X15) )
& ssItem(esk5_0)
& ssItem(esk6_0)
& ssList(esk7_0)
& ssList(esk8_0)
& ssList(esk9_0)
& app(app(app(app(esk7_0,cons(esk5_0,nil)),esk8_0),cons(esk6_0,nil)),esk9_0) = esk1_0
& lt(esk6_0,esk5_0) ),
inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_8])])])]) ).
cnf(c_0_10,negated_conjecture,
app(app(app(app(esk7_0,cons(esk5_0,nil)),esk8_0),cons(esk6_0,nil)),esk9_0) = esk1_0,
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_11,negated_conjecture,
esk1_0 = esk3_0,
inference(split_conjunct,[status(thm)],[c_0_9]) ).
fof(c_0_12,plain,
! [X48,X49,X50] :
( ~ ssList(X48)
| ~ ssList(X49)
| ~ ssList(X50)
| app(app(X48,X49),X50) = app(X48,app(X49,X50)) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax82])])]) ).
cnf(c_0_13,negated_conjecture,
app(app(app(app(esk7_0,cons(esk5_0,nil)),esk8_0),cons(esk6_0,nil)),esk9_0) = esk3_0,
inference(rw,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_14,plain,
( app(app(X1,X2),X3) = app(X1,app(X2,X3))
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_15,negated_conjecture,
ssList(esk8_0),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_16,negated_conjecture,
ssList(esk7_0),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
fof(c_0_17,plain,
! [X46,X47] :
( ~ ssList(X46)
| ~ ssItem(X47)
| cons(X47,X46) = app(cons(X47,nil),X46) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax81])])]) ).
cnf(c_0_18,negated_conjecture,
( app(app(app(esk7_0,app(cons(esk5_0,nil),esk8_0)),cons(esk6_0,nil)),esk9_0) = esk3_0
| ~ ssList(cons(esk5_0,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_15]),c_0_16])]) ).
cnf(c_0_19,plain,
( cons(X2,X1) = app(cons(X2,nil),X1)
| ~ ssList(X1)
| ~ ssItem(X2) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_20,negated_conjecture,
ssItem(esk5_0),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
fof(c_0_21,plain,
! [X1] :
( ssItem(X1)
=> ! [X2] :
( ssItem(X2)
=> ( lt(X1,X2)
=> ~ lt(X2,X1) ) ) ),
inference(fof_simplification,[status(thm)],[ax33]) ).
fof(c_0_22,plain,
! [X69,X70,X71,X72,X73,X74] :
( ( ~ strictorderedP(X69)
| ~ ssItem(X70)
| ~ ssItem(X71)
| ~ ssList(X72)
| ~ ssList(X73)
| ~ ssList(X74)
| app(app(X72,cons(X70,X73)),cons(X71,X74)) != X69
| lt(X70,X71)
| ~ ssList(X69) )
& ( ssItem(esk14_1(X69))
| strictorderedP(X69)
| ~ ssList(X69) )
& ( ssItem(esk15_1(X69))
| strictorderedP(X69)
| ~ ssList(X69) )
& ( ssList(esk16_1(X69))
| strictorderedP(X69)
| ~ ssList(X69) )
& ( ssList(esk17_1(X69))
| strictorderedP(X69)
| ~ ssList(X69) )
& ( ssList(esk18_1(X69))
| strictorderedP(X69)
| ~ ssList(X69) )
& ( app(app(esk16_1(X69),cons(esk14_1(X69),esk17_1(X69))),cons(esk15_1(X69),esk18_1(X69))) = X69
| strictorderedP(X69)
| ~ ssList(X69) )
& ( ~ lt(esk14_1(X69),esk15_1(X69))
| strictorderedP(X69)
| ~ ssList(X69) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax12])])])])]) ).
cnf(c_0_23,negated_conjecture,
( app(app(app(esk7_0,cons(esk5_0,esk8_0)),cons(esk6_0,nil)),esk9_0) = esk3_0
| ~ ssList(cons(esk5_0,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_15]),c_0_20])]) ).
cnf(c_0_24,negated_conjecture,
ssList(esk9_0),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
fof(c_0_25,plain,
! [X21,X22] :
( ~ ssItem(X21)
| ~ ssItem(X22)
| ~ lt(X21,X22)
| ~ lt(X22,X21) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_21])])]) ).
cnf(c_0_26,plain,
( lt(X2,X3)
| ~ strictorderedP(X1)
| ~ ssItem(X2)
| ~ ssItem(X3)
| ~ ssList(X4)
| ~ ssList(X5)
| ~ ssList(X6)
| app(app(X4,cons(X2,X5)),cons(X3,X6)) != X1
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_27,negated_conjecture,
( app(app(esk7_0,cons(esk5_0,esk8_0)),app(cons(esk6_0,nil),esk9_0)) = esk3_0
| ~ ssList(app(esk7_0,cons(esk5_0,esk8_0)))
| ~ ssList(cons(esk6_0,nil))
| ~ ssList(cons(esk5_0,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_23]),c_0_24])]) ).
cnf(c_0_28,negated_conjecture,
ssItem(esk6_0),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_29,negated_conjecture,
ssList(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_30,plain,
( ~ ssItem(X1)
| ~ ssItem(X2)
| ~ lt(X1,X2)
| ~ lt(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_31,negated_conjecture,
lt(esk6_0,esk5_0),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_32,plain,
( lt(X1,X2)
| ~ strictorderedP(app(app(X3,cons(X1,X4)),cons(X2,X5)))
| ~ ssList(app(app(X3,cons(X1,X4)),cons(X2,X5)))
| ~ ssList(X5)
| ~ ssList(X4)
| ~ ssList(X3)
| ~ ssItem(X2)
| ~ ssItem(X1) ),
inference(er,[status(thm)],[c_0_26]) ).
cnf(c_0_33,negated_conjecture,
( app(app(esk7_0,cons(esk5_0,esk8_0)),cons(esk6_0,esk9_0)) = esk3_0
| ~ ssList(app(esk7_0,cons(esk5_0,esk8_0)))
| ~ ssList(cons(esk6_0,nil))
| ~ ssList(cons(esk5_0,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_19]),c_0_24]),c_0_28])]) ).
cnf(c_0_34,negated_conjecture,
strictorderedP(esk3_0),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_35,negated_conjecture,
ssList(esk3_0),
inference(rw,[status(thm)],[c_0_29,c_0_11]) ).
cnf(c_0_36,negated_conjecture,
~ lt(esk5_0,esk6_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_28]),c_0_20])]) ).
fof(c_0_37,plain,
! [X34,X35] :
( ~ ssList(X34)
| ~ ssList(X35)
| ssList(app(X34,X35)) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax26])])]) ).
cnf(c_0_38,negated_conjecture,
( ~ ssList(app(esk7_0,cons(esk5_0,esk8_0)))
| ~ ssList(cons(esk6_0,nil))
| ~ ssList(cons(esk5_0,nil)) ),
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(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_34]),c_0_35]),c_0_24]),c_0_15]),c_0_16]),c_0_28]),c_0_20])]),c_0_36]) ).
cnf(c_0_39,plain,
( ssList(app(X1,X2))
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(split_conjunct,[status(thm)],[c_0_37]) ).
fof(c_0_40,plain,
! [X54,X55] :
( ~ ssList(X54)
| ~ ssItem(X55)
| ssList(cons(X55,X54)) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax16])])]) ).
cnf(c_0_41,negated_conjecture,
( ~ ssList(cons(esk6_0,nil))
| ~ ssList(cons(esk5_0,nil))
| ~ ssList(cons(esk5_0,esk8_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_39]),c_0_16])]) ).
cnf(c_0_42,plain,
( ssList(cons(X2,X1))
| ~ ssList(X1)
| ~ ssItem(X2) ),
inference(split_conjunct,[status(thm)],[c_0_40]) ).
cnf(c_0_43,plain,
ssList(nil),
inference(split_conjunct,[status(thm)],[ax17]) ).
cnf(c_0_44,negated_conjecture,
( ~ ssList(cons(esk5_0,nil))
| ~ ssList(cons(esk5_0,esk8_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_42]),c_0_43]),c_0_28])]) ).
cnf(c_0_45,negated_conjecture,
~ ssList(cons(esk5_0,nil)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_42]),c_0_15]),c_0_20])]) ).
cnf(c_0_46,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_42]),c_0_43]),c_0_20])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : SWC305+1 : TPTP v8.1.2. Released v2.4.0.
% 0.00/0.12 % Command : run_E %s %d THM
% 0.13/0.33 % Computer : n025.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 : 2400
% 0.13/0.33 % WCLimit : 300
% 0.13/0.33 % DateTime : Tue Oct 3 02:04:54 EDT 2023
% 0.13/0.33 % CPUTime :
% 0.18/0.44 Running first-order model finding
% 0.18/0.44 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/tmp/tmp.JwAgXm4pAE/E---3.1_22925.p
% 0.18/0.53 # Version: 3.1pre001
% 0.18/0.53 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.18/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.53 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.18/0.53 # Starting new_bool_3 with 300s (1) cores
% 0.18/0.53 # Starting new_bool_1 with 300s (1) cores
% 0.18/0.53 # Starting sh5l with 300s (1) cores
% 0.18/0.53 # new_bool_1 with pid 23004 completed with status 0
% 0.18/0.53 # Result found by new_bool_1
% 0.18/0.53 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.18/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.53 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.18/0.53 # Starting new_bool_3 with 300s (1) cores
% 0.18/0.53 # Starting new_bool_1 with 300s (1) cores
% 0.18/0.53 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.18/0.53 # Search class: FGHSF-FFMM21-MFFFFFNN
% 0.18/0.53 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.18/0.53 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 0.18/0.53 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 23007 completed with status 0
% 0.18/0.53 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.18/0.53 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.18/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.53 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.18/0.53 # Starting new_bool_3 with 300s (1) cores
% 0.18/0.53 # Starting new_bool_1 with 300s (1) cores
% 0.18/0.53 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.18/0.53 # Search class: FGHSF-FFMM21-MFFFFFNN
% 0.18/0.53 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.18/0.53 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 0.18/0.53 # Preprocessing time : 0.003 s
% 0.18/0.53 # Presaturation interreduction done
% 0.18/0.53
% 0.18/0.53 # Proof found!
% 0.18/0.53 # SZS status Theorem
% 0.18/0.53 # SZS output start CNFRefutation
% See solution above
% 0.18/0.53 # Parsed axioms : 96
% 0.18/0.53 # Removed by relevancy pruning/SinE : 39
% 0.18/0.53 # Initial clauses : 105
% 0.18/0.53 # Removed in clause preprocessing : 1
% 0.18/0.53 # Initial clauses in saturation : 104
% 0.18/0.53 # Processed clauses : 604
% 0.18/0.53 # ...of these trivial : 2
% 0.18/0.53 # ...subsumed : 80
% 0.18/0.53 # ...remaining for further processing : 522
% 0.18/0.53 # Other redundant clauses eliminated : 26
% 0.18/0.53 # Clauses deleted for lack of memory : 0
% 0.18/0.53 # Backward-subsumed : 60
% 0.18/0.53 # Backward-rewritten : 9
% 0.18/0.53 # Generated clauses : 3238
% 0.18/0.53 # ...of the previous two non-redundant : 3101
% 0.18/0.53 # ...aggressively subsumed : 0
% 0.18/0.53 # Contextual simplify-reflections : 35
% 0.18/0.53 # Paramodulations : 3194
% 0.18/0.53 # Factorizations : 0
% 0.18/0.53 # NegExts : 0
% 0.18/0.53 # Equation resolutions : 30
% 0.18/0.53 # Total rewrite steps : 678
% 0.18/0.53 # Propositional unsat checks : 0
% 0.18/0.53 # Propositional check models : 0
% 0.18/0.53 # Propositional check unsatisfiable : 0
% 0.18/0.53 # Propositional clauses : 0
% 0.18/0.53 # Propositional clauses after purity: 0
% 0.18/0.53 # Propositional unsat core size : 0
% 0.18/0.53 # Propositional preprocessing time : 0.000
% 0.18/0.53 # Propositional encoding time : 0.000
% 0.18/0.53 # Propositional solver time : 0.000
% 0.18/0.53 # Success case prop preproc time : 0.000
% 0.18/0.53 # Success case prop encoding time : 0.000
% 0.18/0.53 # Success case prop solver time : 0.000
% 0.18/0.53 # Current number of processed clauses : 328
% 0.18/0.53 # Positive orientable unit clauses : 37
% 0.18/0.53 # Positive unorientable unit clauses: 0
% 0.18/0.53 # Negative unit clauses : 10
% 0.18/0.53 # Non-unit-clauses : 281
% 0.18/0.53 # Current number of unprocessed clauses: 2654
% 0.18/0.53 # ...number of literals in the above : 10767
% 0.18/0.53 # Current number of archived formulas : 0
% 0.18/0.53 # Current number of archived clauses : 183
% 0.18/0.53 # Clause-clause subsumption calls (NU) : 26244
% 0.18/0.53 # Rec. Clause-clause subsumption calls : 14565
% 0.18/0.53 # Non-unit clause-clause subsumptions : 141
% 0.18/0.53 # Unit Clause-clause subsumption calls : 2009
% 0.18/0.53 # Rewrite failures with RHS unbound : 0
% 0.18/0.53 # BW rewrite match attempts : 5
% 0.18/0.53 # BW rewrite match successes : 5
% 0.18/0.53 # Condensation attempts : 0
% 0.18/0.53 # Condensation successes : 0
% 0.18/0.53 # Termbank termtop insertions : 56723
% 0.18/0.53
% 0.18/0.53 # -------------------------------------------------
% 0.18/0.53 # User time : 0.070 s
% 0.18/0.53 # System time : 0.006 s
% 0.18/0.53 # Total time : 0.077 s
% 0.18/0.53 # Maximum resident set size: 2092 pages
% 0.18/0.53
% 0.18/0.53 # -------------------------------------------------
% 0.18/0.53 # User time : 0.072 s
% 0.18/0.53 # System time : 0.009 s
% 0.18/0.53 # Total time : 0.081 s
% 0.18/0.53 # Maximum resident set size: 1804 pages
% 0.18/0.53 % E---3.1 exiting
%------------------------------------------------------------------------------