TSTP Solution File: SWC175+1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : SWC175+1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n009.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:39:43 EDT 2023
% Result : Theorem 0.16s 0.49s
% Output : CNFRefutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 9
% Syntax : Number of formulae : 47 ( 16 unt; 0 def)
% Number of atoms : 221 ( 45 equ)
% Maximal formula atoms : 30 ( 4 avg)
% Number of connectives : 270 ( 96 ~; 96 |; 38 &)
% ( 2 <=>; 38 =>; 0 <=; 0 <~>)
% Maximal formula depth : 27 ( 6 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 17 ( 17 usr; 10 con; 0-2 aty)
% Number of variables : 91 ( 0 sgn; 59 !; 8 ?)
% Comments :
%------------------------------------------------------------------------------
fof(co1,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ! [X5] :
( ssList(X5)
=> ( app(X3,X5) != X4
| ~ strictorderedP(X3)
| ? [X6] :
( ssItem(X6)
& ? [X7] :
( ssList(X7)
& app(cons(X6,nil),X7) = X5
& ? [X8] :
( ssItem(X8)
& ? [X9] :
( ssList(X9)
& app(X9,cons(X8,nil)) = X3
& lt(X8,X6) ) ) ) ) ) )
| ! [X10] :
( ssItem(X10)
=> ! [X11] :
( ssItem(X11)
=> ( ! [X12] :
( ssList(X12)
=> ! [X13] :
( ssList(X13)
=> app(app(app(X12,cons(X10,nil)),cons(X11,nil)),X13) != X1 ) )
| neq(X10,X11) ) ) )
| ( nil != X4
& nil = X3 ) ) ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.4KyWar5we6/E---3.1_5290.p',co1) ).
fof(ax1,axiom,
! [X1] :
( ssItem(X1)
=> ! [X2] :
( ssItem(X2)
=> ( neq(X1,X2)
<=> X1 != X2 ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.4KyWar5we6/E---3.1_5290.p',ax1) ).
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.4KyWar5we6/E---3.1_5290.p',ax82) ).
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.4KyWar5we6/E---3.1_5290.p',ax12) ).
fof(ax81,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> cons(X2,X1) = app(cons(X2,nil),X1) ) ),
file('/export/starexec/sandbox2/tmp/tmp.4KyWar5we6/E---3.1_5290.p',ax81) ).
fof(ax90,axiom,
! [X1] :
( ssItem(X1)
=> ~ lt(X1,X1) ),
file('/export/starexec/sandbox2/tmp/tmp.4KyWar5we6/E---3.1_5290.p',ax90) ).
fof(ax17,axiom,
ssList(nil),
file('/export/starexec/sandbox2/tmp/tmp.4KyWar5we6/E---3.1_5290.p',ax17) ).
fof(ax26,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ssList(app(X1,X2)) ) ),
file('/export/starexec/sandbox2/tmp/tmp.4KyWar5we6/E---3.1_5290.p',ax26) ).
fof(ax16,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> ssList(cons(X2,X1)) ) ),
file('/export/starexec/sandbox2/tmp/tmp.4KyWar5we6/E---3.1_5290.p',ax16) ).
fof(c_0_9,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ! [X5] :
( ssList(X5)
=> ( app(X3,X5) != X4
| ~ strictorderedP(X3)
| ? [X6] :
( ssItem(X6)
& ? [X7] :
( ssList(X7)
& app(cons(X6,nil),X7) = X5
& ? [X8] :
( ssItem(X8)
& ? [X9] :
( ssList(X9)
& app(X9,cons(X8,nil)) = X3
& lt(X8,X6) ) ) ) ) ) )
| ! [X10] :
( ssItem(X10)
=> ! [X11] :
( ssItem(X11)
=> ( ! [X12] :
( ssList(X12)
=> ! [X13] :
( ssList(X13)
=> app(app(app(X12,cons(X10,nil)),cons(X11,nil)),X13) != X1 ) )
| neq(X10,X11) ) ) )
| ( nil != X4
& nil = X3 ) ) ) ) ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[co1])]) ).
fof(c_0_10,plain,
! [X32,X33] :
( ( ~ neq(X32,X33)
| X32 != X33
| ~ ssItem(X33)
| ~ ssItem(X32) )
& ( X32 = X33
| neq(X32,X33)
| ~ ssItem(X33)
| ~ ssItem(X32) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax1])])])]) ).
fof(c_0_11,negated_conjecture,
! [X19,X20,X21,X22] :
( ssList(esk1_0)
& ssList(esk2_0)
& ssList(esk3_0)
& ssList(esk4_0)
& esk2_0 = esk4_0
& esk1_0 = esk3_0
& ssList(esk5_0)
& app(esk3_0,esk5_0) = esk4_0
& strictorderedP(esk3_0)
& ( ~ ssItem(X19)
| ~ ssList(X20)
| app(cons(X19,nil),X20) != esk5_0
| ~ ssItem(X21)
| ~ ssList(X22)
| app(X22,cons(X21,nil)) != esk3_0
| ~ lt(X21,X19) )
& ssItem(esk6_0)
& ssItem(esk7_0)
& ssList(esk8_0)
& ssList(esk9_0)
& app(app(app(esk8_0,cons(esk6_0,nil)),cons(esk7_0,nil)),esk9_0) = esk1_0
& ~ neq(esk6_0,esk7_0)
& ( nil = esk4_0
| nil != esk3_0 ) ),
inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_9])])])]) ).
cnf(c_0_12,plain,
( X1 = X2
| neq(X1,X2)
| ~ ssItem(X2)
| ~ ssItem(X1) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_13,negated_conjecture,
ssItem(esk7_0),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_14,negated_conjecture,
app(app(app(esk8_0,cons(esk6_0,nil)),cons(esk7_0,nil)),esk9_0) = esk1_0,
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_15,negated_conjecture,
esk1_0 = esk3_0,
inference(split_conjunct,[status(thm)],[c_0_11]) ).
fof(c_0_16,plain,
! [X50,X51,X52] :
( ~ ssList(X50)
| ~ ssList(X51)
| ~ ssList(X52)
| app(app(X50,X51),X52) = app(X50,app(X51,X52)) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax82])])]) ).
cnf(c_0_17,negated_conjecture,
( X1 = esk7_0
| neq(X1,esk7_0)
| ~ ssItem(X1) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_18,negated_conjecture,
ssItem(esk6_0),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_19,negated_conjecture,
~ neq(esk6_0,esk7_0),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
fof(c_0_20,plain,
! [X79,X80,X81,X82,X83,X84] :
( ( ~ strictorderedP(X79)
| ~ ssItem(X80)
| ~ ssItem(X81)
| ~ ssList(X82)
| ~ ssList(X83)
| ~ ssList(X84)
| app(app(X82,cons(X80,X83)),cons(X81,X84)) != X79
| lt(X80,X81)
| ~ ssList(X79) )
& ( ssItem(esk14_1(X79))
| strictorderedP(X79)
| ~ ssList(X79) )
& ( ssItem(esk15_1(X79))
| strictorderedP(X79)
| ~ ssList(X79) )
& ( ssList(esk16_1(X79))
| strictorderedP(X79)
| ~ ssList(X79) )
& ( ssList(esk17_1(X79))
| strictorderedP(X79)
| ~ ssList(X79) )
& ( ssList(esk18_1(X79))
| strictorderedP(X79)
| ~ ssList(X79) )
& ( app(app(esk16_1(X79),cons(esk14_1(X79),esk17_1(X79))),cons(esk15_1(X79),esk18_1(X79))) = X79
| strictorderedP(X79)
| ~ ssList(X79) )
& ( ~ lt(esk14_1(X79),esk15_1(X79))
| strictorderedP(X79)
| ~ ssList(X79) ) ),
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_21,negated_conjecture,
app(app(app(esk8_0,cons(esk6_0,nil)),cons(esk7_0,nil)),esk9_0) = esk3_0,
inference(rw,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_22,plain,
( app(app(X1,X2),X3) = app(X1,app(X2,X3))
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_23,negated_conjecture,
ssList(esk9_0),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_24,negated_conjecture,
esk7_0 = esk6_0,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_19]) ).
fof(c_0_25,plain,
! [X48,X49] :
( ~ ssList(X48)
| ~ ssItem(X49)
| cons(X49,X48) = app(cons(X49,nil),X48) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax81])])]) ).
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_20]) ).
cnf(c_0_27,negated_conjecture,
( app(app(esk8_0,cons(esk6_0,nil)),app(cons(esk6_0,nil),esk9_0)) = esk3_0
| ~ ssList(app(esk8_0,cons(esk6_0,nil)))
| ~ ssList(cons(esk6_0,nil)) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_23])]),c_0_24]),c_0_24]) ).
cnf(c_0_28,plain,
( cons(X2,X1) = app(cons(X2,nil),X1)
| ~ ssList(X1)
| ~ ssItem(X2) ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_29,negated_conjecture,
ssList(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
fof(c_0_30,plain,
! [X1] :
( ssItem(X1)
=> ~ lt(X1,X1) ),
inference(fof_simplification,[status(thm)],[ax90]) ).
cnf(c_0_31,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_32,negated_conjecture,
( app(app(esk8_0,cons(esk6_0,nil)),cons(esk6_0,esk9_0)) = esk3_0
| ~ ssList(app(esk8_0,cons(esk6_0,nil)))
| ~ ssList(cons(esk6_0,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_23]),c_0_18])]) ).
cnf(c_0_33,negated_conjecture,
strictorderedP(esk3_0),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_34,negated_conjecture,
ssList(esk3_0),
inference(rw,[status(thm)],[c_0_29,c_0_15]) ).
cnf(c_0_35,plain,
ssList(nil),
inference(split_conjunct,[status(thm)],[ax17]) ).
cnf(c_0_36,negated_conjecture,
ssList(esk8_0),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
fof(c_0_37,plain,
! [X36,X37] :
( ~ ssList(X36)
| ~ ssList(X37)
| ssList(app(X36,X37)) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax26])])]) ).
fof(c_0_38,plain,
! [X71] :
( ~ ssItem(X71)
| ~ lt(X71,X71) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_30])]) ).
cnf(c_0_39,negated_conjecture,
( lt(esk6_0,esk6_0)
| ~ ssList(app(esk8_0,cons(esk6_0,nil)))
| ~ ssList(cons(esk6_0,nil)) ),
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_31,c_0_32]),c_0_33]),c_0_34]),c_0_23]),c_0_35]),c_0_36]),c_0_18])]) ).
cnf(c_0_40,plain,
( ssList(app(X1,X2))
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(split_conjunct,[status(thm)],[c_0_37]) ).
cnf(c_0_41,plain,
( ~ ssItem(X1)
| ~ lt(X1,X1) ),
inference(split_conjunct,[status(thm)],[c_0_38]) ).
cnf(c_0_42,negated_conjecture,
( lt(esk6_0,esk6_0)
| ~ ssList(cons(esk6_0,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_40]),c_0_36])]) ).
fof(c_0_43,plain,
! [X56,X57] :
( ~ ssList(X56)
| ~ ssItem(X57)
| ssList(cons(X57,X56)) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax16])])]) ).
cnf(c_0_44,negated_conjecture,
~ ssList(cons(esk6_0,nil)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_42]),c_0_18])]) ).
cnf(c_0_45,plain,
( ssList(cons(X2,X1))
| ~ ssList(X1)
| ~ ssItem(X2) ),
inference(split_conjunct,[status(thm)],[c_0_43]) ).
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_44,c_0_45]),c_0_35]),c_0_18])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.10 % Problem : SWC175+1 : TPTP v8.1.2. Released v2.4.0.
% 0.02/0.11 % Command : run_E %s %d THM
% 0.11/0.31 % Computer : n009.cluster.edu
% 0.11/0.31 % Model : x86_64 x86_64
% 0.11/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.31 % Memory : 8042.1875MB
% 0.11/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.31 % CPULimit : 2400
% 0.11/0.31 % WCLimit : 300
% 0.11/0.31 % DateTime : Tue Oct 3 02:00:59 EDT 2023
% 0.11/0.31 % CPUTime :
% 0.16/0.42 Running first-order theorem proving
% 0.16/0.42 Running: /export/starexec/sandbox2/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/sandbox2/tmp/tmp.4KyWar5we6/E---3.1_5290.p
% 0.16/0.49 # Version: 3.1pre001
% 0.16/0.49 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.16/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.49 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.16/0.49 # Starting new_bool_3 with 300s (1) cores
% 0.16/0.49 # Starting new_bool_1 with 300s (1) cores
% 0.16/0.49 # Starting sh5l with 300s (1) cores
% 0.16/0.49 # new_bool_1 with pid 5370 completed with status 0
% 0.16/0.49 # Result found by new_bool_1
% 0.16/0.49 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.16/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.49 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.16/0.49 # Starting new_bool_3 with 300s (1) cores
% 0.16/0.49 # Starting new_bool_1 with 300s (1) cores
% 0.16/0.49 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.16/0.49 # Search class: FGHSF-FFMM21-MFFFFFNN
% 0.16/0.49 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.16/0.49 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 0.16/0.49 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 5373 completed with status 0
% 0.16/0.49 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.16/0.49 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.16/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.49 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.16/0.49 # Starting new_bool_3 with 300s (1) cores
% 0.16/0.49 # Starting new_bool_1 with 300s (1) cores
% 0.16/0.49 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.16/0.49 # Search class: FGHSF-FFMM21-MFFFFFNN
% 0.16/0.49 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.16/0.49 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 0.16/0.49 # Preprocessing time : 0.002 s
% 0.16/0.49 # Presaturation interreduction done
% 0.16/0.49
% 0.16/0.49 # Proof found!
% 0.16/0.49 # SZS status Theorem
% 0.16/0.49 # SZS output start CNFRefutation
% See solution above
% 0.16/0.49 # Parsed axioms : 96
% 0.16/0.49 # Removed by relevancy pruning/SinE : 54
% 0.16/0.49 # Initial clauses : 82
% 0.16/0.49 # Removed in clause preprocessing : 1
% 0.16/0.49 # Initial clauses in saturation : 81
% 0.16/0.49 # Processed clauses : 565
% 0.16/0.49 # ...of these trivial : 13
% 0.16/0.49 # ...subsumed : 118
% 0.16/0.49 # ...remaining for further processing : 434
% 0.16/0.49 # Other redundant clauses eliminated : 14
% 0.16/0.49 # Clauses deleted for lack of memory : 0
% 0.16/0.49 # Backward-subsumed : 76
% 0.16/0.49 # Backward-rewritten : 8
% 0.16/0.49 # Generated clauses : 2717
% 0.16/0.49 # ...of the previous two non-redundant : 2567
% 0.16/0.49 # ...aggressively subsumed : 0
% 0.16/0.49 # Contextual simplify-reflections : 15
% 0.16/0.49 # Paramodulations : 2686
% 0.16/0.49 # Factorizations : 0
% 0.16/0.49 # NegExts : 0
% 0.16/0.49 # Equation resolutions : 18
% 0.16/0.49 # Total rewrite steps : 574
% 0.16/0.49 # Propositional unsat checks : 0
% 0.16/0.49 # Propositional check models : 0
% 0.16/0.49 # Propositional check unsatisfiable : 0
% 0.16/0.49 # Propositional clauses : 0
% 0.16/0.49 # Propositional clauses after purity: 0
% 0.16/0.49 # Propositional unsat core size : 0
% 0.16/0.49 # Propositional preprocessing time : 0.000
% 0.16/0.49 # Propositional encoding time : 0.000
% 0.16/0.49 # Propositional solver time : 0.000
% 0.16/0.49 # Success case prop preproc time : 0.000
% 0.16/0.49 # Success case prop encoding time : 0.000
% 0.16/0.49 # Success case prop solver time : 0.000
% 0.16/0.49 # Current number of processed clauses : 254
% 0.16/0.49 # Positive orientable unit clauses : 35
% 0.16/0.49 # Positive unorientable unit clauses: 0
% 0.16/0.49 # Negative unit clauses : 6
% 0.16/0.49 # Non-unit-clauses : 213
% 0.16/0.49 # Current number of unprocessed clauses: 2052
% 0.16/0.49 # ...number of literals in the above : 7528
% 0.16/0.49 # Current number of archived formulas : 0
% 0.16/0.49 # Current number of archived clauses : 174
% 0.16/0.49 # Clause-clause subsumption calls (NU) : 21776
% 0.16/0.49 # Rec. Clause-clause subsumption calls : 14874
% 0.16/0.49 # Non-unit clause-clause subsumptions : 166
% 0.16/0.49 # Unit Clause-clause subsumption calls : 1504
% 0.16/0.49 # Rewrite failures with RHS unbound : 0
% 0.16/0.49 # BW rewrite match attempts : 5
% 0.16/0.49 # BW rewrite match successes : 4
% 0.16/0.49 # Condensation attempts : 0
% 0.16/0.49 # Condensation successes : 0
% 0.16/0.49 # Termbank termtop insertions : 44246
% 0.16/0.49
% 0.16/0.49 # -------------------------------------------------
% 0.16/0.49 # User time : 0.051 s
% 0.16/0.49 # System time : 0.006 s
% 0.16/0.49 # Total time : 0.057 s
% 0.16/0.49 # Maximum resident set size: 2060 pages
% 0.16/0.49
% 0.16/0.49 # -------------------------------------------------
% 0.16/0.49 # User time : 0.053 s
% 0.16/0.49 # System time : 0.009 s
% 0.16/0.49 # Total time : 0.061 s
% 0.16/0.49 # Maximum resident set size: 1808 pages
% 0.16/0.49 % E---3.1 exiting
% 0.16/0.49 % E---3.1 exiting
%------------------------------------------------------------------------------