TSTP Solution File: SWC420+1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SWC420+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:26:35 EDT 2024
% Result : Theorem 0.14s 0.45s
% Output : CNFRefutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 8
% Syntax : Number of formulae : 53 ( 13 unt; 0 def)
% Number of atoms : 200 ( 78 equ)
% Maximal formula atoms : 18 ( 3 avg)
% Number of connectives : 243 ( 96 ~; 98 |; 30 &)
% ( 2 <=>; 17 =>; 0 <=; 0 <~>)
% Maximal formula depth : 21 ( 5 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 5 con; 0-2 aty)
% Number of variables : 68 ( 0 sgn 33 !; 12 ?)
% Comments :
%------------------------------------------------------------------------------
fof(co1,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ~ ssList(X4)
| X2 != X4
| X1 != X3
| ~ neq(X2,nil)
| ? [X5] :
( ssItem(X5)
& ? [X6] :
( ssList(X6)
& ? [X7] :
( ssList(X7)
& app(app(X6,cons(X5,nil)),X7) = X2
& app(app(X7,cons(X5,nil)),X6) = X1 ) ) )
| ? [X8] :
( ssItem(X8)
& ? [X9] :
( ssList(X9)
& app(X9,cons(X8,nil)) != X3
& app(cons(X8,nil),X9) = X4 ) )
| ( nil != X3
& nil = X4 ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).
fof(ax81,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> cons(X2,X1) = app(cons(X2,nil),X1) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax81) ).
fof(ax20,axiom,
! [X1] :
( ssList(X1)
=> ( nil = X1
| ? [X2] :
( ssList(X2)
& ? [X3] :
( ssItem(X3)
& cons(X3,X2) = X1 ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax20) ).
fof(ax84,axiom,
! [X1] :
( ssList(X1)
=> app(X1,nil) = X1 ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax84) ).
fof(ax17,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax17) ).
fof(ax28,axiom,
! [X1] :
( ssList(X1)
=> app(nil,X1) = X1 ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax28) ).
fof(ax16,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> ssList(cons(X2,X1)) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax16) ).
fof(ax15,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( neq(X1,X2)
<=> X1 != X2 ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax15) ).
fof(c_0_8,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ~ ssList(X4)
| X2 != X4
| X1 != X3
| ~ neq(X2,nil)
| ? [X5] :
( ssItem(X5)
& ? [X6] :
( ssList(X6)
& ? [X7] :
( ssList(X7)
& app(app(X6,cons(X5,nil)),X7) = X2
& app(app(X7,cons(X5,nil)),X6) = X1 ) ) )
| ? [X8] :
( ssItem(X8)
& ? [X9] :
( ssList(X9)
& app(X9,cons(X8,nil)) != X3
& app(cons(X8,nil),X9) = X4 ) )
| ( nil != X3
& nil = X4 ) ) ) ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[co1])]) ).
fof(c_0_9,negated_conjecture,
! [X258,X259,X260,X261,X262] :
( ssList(esk48_0)
& ssList(esk49_0)
& ssList(esk50_0)
& ssList(esk51_0)
& esk49_0 = esk51_0
& esk48_0 = esk50_0
& neq(esk49_0,nil)
& ( ~ ssItem(X258)
| ~ ssList(X259)
| ~ ssList(X260)
| app(app(X259,cons(X258,nil)),X260) != esk49_0
| app(app(X260,cons(X258,nil)),X259) != esk48_0 )
& ( ~ ssItem(X261)
| ~ ssList(X262)
| app(X262,cons(X261,nil)) = esk50_0
| app(cons(X261,nil),X262) != esk51_0 )
& ( nil = esk50_0
| nil != esk51_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_8])])])])]) ).
fof(c_0_10,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_11,negated_conjecture,
( app(X2,cons(X1,nil)) = esk50_0
| ~ ssItem(X1)
| ~ ssList(X2)
| app(cons(X1,nil),X2) != esk51_0 ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_12,plain,
( cons(X2,X1) = app(cons(X2,nil),X1)
| ~ ssList(X1)
| ~ ssItem(X2) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
fof(c_0_13,plain,
! [X122] :
( ( ssList(esk44_1(X122))
| nil = X122
| ~ ssList(X122) )
& ( ssItem(esk45_1(X122))
| nil = X122
| ~ ssList(X122) )
& ( cons(esk45_1(X122),esk44_1(X122)) = X122
| nil = X122
| ~ ssList(X122) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax20])])])])]) ).
cnf(c_0_14,negated_conjecture,
ssList(esk49_0),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_15,negated_conjecture,
esk49_0 = esk51_0,
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_16,negated_conjecture,
( app(X1,cons(X2,nil)) = esk50_0
| cons(X2,X1) != esk51_0
| ~ ssList(X1)
| ~ ssItem(X2) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_17,plain,
( cons(esk45_1(X1),esk44_1(X1)) = X1
| nil = X1
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_18,negated_conjecture,
ssList(esk51_0),
inference(rw,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_19,negated_conjecture,
( app(esk44_1(esk51_0),cons(esk45_1(esk51_0),nil)) = esk50_0
| esk51_0 = nil
| ~ ssList(esk44_1(esk51_0))
| ~ ssItem(esk45_1(esk51_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17])]),c_0_18])]) ).
cnf(c_0_20,plain,
( ssItem(esk45_1(X1))
| nil = X1
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_21,negated_conjecture,
( ~ ssItem(X1)
| ~ ssList(X2)
| ~ ssList(X3)
| app(app(X2,cons(X1,nil)),X3) != esk49_0
| app(app(X3,cons(X1,nil)),X2) != esk48_0 ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_22,negated_conjecture,
esk48_0 = esk50_0,
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_23,negated_conjecture,
( app(esk44_1(esk51_0),cons(esk45_1(esk51_0),nil)) = esk50_0
| esk51_0 = nil
| ~ ssList(esk44_1(esk51_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_18])]) ).
cnf(c_0_24,plain,
( ssList(esk44_1(X1))
| nil = X1
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_25,negated_conjecture,
( app(app(X1,cons(X2,nil)),X3) != esk50_0
| app(app(X3,cons(X2,nil)),X1) != esk51_0
| ~ ssList(X1)
| ~ ssList(X3)
| ~ ssItem(X2) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_21,c_0_22]),c_0_15]) ).
cnf(c_0_26,negated_conjecture,
( app(esk44_1(esk51_0),cons(esk45_1(esk51_0),nil)) = esk50_0
| esk51_0 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_18])]) ).
fof(c_0_27,plain,
! [X230] :
( ~ ssList(X230)
| app(X230,nil) = X230 ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax84])])]) ).
cnf(c_0_28,negated_conjecture,
ssList(esk48_0),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_29,negated_conjecture,
( esk51_0 = nil
| app(app(X1,cons(esk45_1(esk51_0),nil)),esk44_1(esk51_0)) != esk51_0
| app(esk50_0,X1) != esk50_0
| ~ ssList(esk44_1(esk51_0))
| ~ ssList(X1)
| ~ ssItem(esk45_1(esk51_0)) ),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_30,plain,
( app(X1,nil) = X1
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_31,plain,
ssList(nil),
inference(split_conjunct,[status(thm)],[ax17]) ).
cnf(c_0_32,negated_conjecture,
ssList(esk50_0),
inference(rw,[status(thm)],[c_0_28,c_0_22]) ).
fof(c_0_33,plain,
! [X138] :
( ~ ssList(X138)
| app(nil,X138) = X138 ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax28])])]) ).
cnf(c_0_34,negated_conjecture,
( esk51_0 = nil
| app(app(nil,cons(esk45_1(esk51_0),nil)),esk44_1(esk51_0)) != esk51_0
| ~ ssList(esk44_1(esk51_0))
| ~ ssItem(esk45_1(esk51_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_31]),c_0_32])]) ).
cnf(c_0_35,plain,
( app(nil,X1) = X1
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_33]) ).
cnf(c_0_36,negated_conjecture,
( esk51_0 = nil
| app(cons(esk45_1(esk51_0),nil),esk44_1(esk51_0)) != esk51_0
| ~ ssList(cons(esk45_1(esk51_0),nil))
| ~ ssList(esk44_1(esk51_0))
| ~ ssItem(esk45_1(esk51_0)) ),
inference(spm,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_37,negated_conjecture,
( esk51_0 = nil
| cons(esk45_1(esk51_0),esk44_1(esk51_0)) != esk51_0
| ~ ssList(cons(esk45_1(esk51_0),nil))
| ~ ssList(esk44_1(esk51_0))
| ~ ssItem(esk45_1(esk51_0)) ),
inference(spm,[status(thm)],[c_0_36,c_0_12]) ).
cnf(c_0_38,negated_conjecture,
( esk51_0 = nil
| ~ ssList(cons(esk45_1(esk51_0),nil))
| ~ ssList(esk44_1(esk51_0))
| ~ ssItem(esk45_1(esk51_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_17]),c_0_18])]) ).
cnf(c_0_39,negated_conjecture,
( esk51_0 = nil
| ~ ssList(cons(esk45_1(esk51_0),nil))
| ~ ssList(esk44_1(esk51_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_20]),c_0_18])]) ).
fof(c_0_40,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])])])]) ).
fof(c_0_41,plain,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( neq(X1,X2)
<=> X1 != X2 ) ) ),
inference(fof_simplification,[status(thm)],[ax15]) ).
cnf(c_0_42,negated_conjecture,
( esk51_0 = nil
| ~ ssList(cons(esk45_1(esk51_0),nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_24]),c_0_18])]) ).
cnf(c_0_43,plain,
( ssList(cons(X2,X1))
| ~ ssList(X1)
| ~ ssItem(X2) ),
inference(split_conjunct,[status(thm)],[c_0_40]) ).
fof(c_0_44,plain,
! [X112,X113] :
( ( ~ neq(X112,X113)
| X112 != X113
| ~ ssList(X113)
| ~ ssList(X112) )
& ( X112 = X113
| neq(X112,X113)
| ~ ssList(X113)
| ~ ssList(X112) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_41])])])])]) ).
cnf(c_0_45,negated_conjecture,
neq(esk49_0,nil),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_46,negated_conjecture,
( esk51_0 = nil
| ~ ssItem(esk45_1(esk51_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_43]),c_0_31])]) ).
cnf(c_0_47,plain,
( ~ neq(X1,X2)
| X1 != X2
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_44]) ).
cnf(c_0_48,negated_conjecture,
neq(esk51_0,nil),
inference(rw,[status(thm)],[c_0_45,c_0_15]) ).
cnf(c_0_49,negated_conjecture,
esk51_0 = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_20]),c_0_18])]) ).
cnf(c_0_50,plain,
( ~ ssList(X1)
| ~ neq(X1,X1) ),
inference(er,[status(thm)],[c_0_47]) ).
cnf(c_0_51,negated_conjecture,
neq(nil,nil),
inference(rw,[status(thm)],[c_0_48,c_0_49]) ).
cnf(c_0_52,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_51]),c_0_31])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.09 % Problem : SWC420+1 : TPTP v8.2.0. Released v2.4.0.
% 0.00/0.10 % Command : run_E %s %d THM
% 0.09/0.29 % Computer : n022.cluster.edu
% 0.09/0.29 % Model : x86_64 x86_64
% 0.09/0.29 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.29 % Memory : 8042.1875MB
% 0.09/0.29 % OS : Linux 3.10.0-693.el7.x86_64
% 0.09/0.29 % CPULimit : 300
% 0.09/0.29 % WCLimit : 300
% 0.09/0.29 % DateTime : Sun May 19 02:57:22 EDT 2024
% 0.09/0.29 % CPUTime :
% 0.14/0.39 Running first-order theorem proving
% 0.14/0.39 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.14/0.45 # Version: 3.1.0
% 0.14/0.45 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.14/0.45 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.45 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.14/0.45 # Starting new_bool_3 with 300s (1) cores
% 0.14/0.45 # Starting new_bool_1 with 300s (1) cores
% 0.14/0.45 # Starting sh5l with 300s (1) cores
% 0.14/0.45 # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 3704 completed with status 0
% 0.14/0.45 # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.14/0.45 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.14/0.45 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.45 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.14/0.45 # No SInE strategy applied
% 0.14/0.45 # Search class: FGHSF-FSLM21-MFFFFFNN
% 0.14/0.45 # Scheduled 11 strats onto 5 cores with 1500 seconds (1500 total)
% 0.14/0.45 # Starting G-E--_208_C18_SOS_F1_SE_CS_SP_PS_S4c with 136s (1) cores
% 0.14/0.45 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.14/0.45 # Starting G-E--_110_C45_F1_PI_SE_CS_SP_PS_S4S with 136s (1) cores
% 0.14/0.45 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_TT_S0Y with 136s (1) cores
% 0.14/0.45 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2o with 136s (1) cores
% 0.14/0.45 # G-E--_208_C18_F1_SE_CS_SP_PS_S2o with pid 3714 completed with status 0
% 0.14/0.45 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S2o
% 0.14/0.45 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.14/0.45 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.45 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.14/0.45 # No SInE strategy applied
% 0.14/0.45 # Search class: FGHSF-FSLM21-MFFFFFNN
% 0.14/0.45 # Scheduled 11 strats onto 5 cores with 1500 seconds (1500 total)
% 0.14/0.45 # Starting G-E--_208_C18_SOS_F1_SE_CS_SP_PS_S4c with 136s (1) cores
% 0.14/0.45 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.14/0.45 # Starting G-E--_110_C45_F1_PI_SE_CS_SP_PS_S4S with 136s (1) cores
% 0.14/0.45 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_TT_S0Y with 136s (1) cores
% 0.14/0.45 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2o with 136s (1) cores
% 0.14/0.45 # Preprocessing time : 0.003 s
% 0.14/0.45 # Presaturation interreduction done
% 0.14/0.45
% 0.14/0.45 # Proof found!
% 0.14/0.45 # SZS status Theorem
% 0.14/0.45 # SZS output start CNFRefutation
% See solution above
% 0.14/0.45 # Parsed axioms : 96
% 0.14/0.45 # Removed by relevancy pruning/SinE : 0
% 0.14/0.45 # Initial clauses : 200
% 0.14/0.45 # Removed in clause preprocessing : 2
% 0.14/0.45 # Initial clauses in saturation : 198
% 0.14/0.45 # Processed clauses : 642
% 0.14/0.45 # ...of these trivial : 2
% 0.14/0.45 # ...subsumed : 121
% 0.14/0.45 # ...remaining for further processing : 519
% 0.14/0.45 # Other redundant clauses eliminated : 79
% 0.14/0.45 # Clauses deleted for lack of memory : 0
% 0.14/0.45 # Backward-subsumed : 38
% 0.14/0.45 # Backward-rewritten : 45
% 0.14/0.45 # Generated clauses : 961
% 0.14/0.45 # ...of the previous two non-redundant : 838
% 0.14/0.45 # ...aggressively subsumed : 0
% 0.14/0.45 # Contextual simplify-reflections : 29
% 0.14/0.45 # Paramodulations : 879
% 0.14/0.45 # Factorizations : 0
% 0.14/0.45 # NegExts : 0
% 0.14/0.45 # Equation resolutions : 84
% 0.14/0.45 # Disequality decompositions : 0
% 0.14/0.45 # Total rewrite steps : 400
% 0.14/0.45 # ...of those cached : 387
% 0.14/0.45 # Propositional unsat checks : 0
% 0.14/0.45 # Propositional check models : 0
% 0.14/0.45 # Propositional check unsatisfiable : 0
% 0.14/0.45 # Propositional clauses : 0
% 0.14/0.45 # Propositional clauses after purity: 0
% 0.14/0.45 # Propositional unsat core size : 0
% 0.14/0.45 # Propositional preprocessing time : 0.000
% 0.14/0.45 # Propositional encoding time : 0.000
% 0.14/0.45 # Propositional solver time : 0.000
% 0.14/0.45 # Success case prop preproc time : 0.000
% 0.14/0.45 # Success case prop encoding time : 0.000
% 0.14/0.45 # Success case prop solver time : 0.000
% 0.14/0.45 # Current number of processed clauses : 221
% 0.14/0.45 # Positive orientable unit clauses : 21
% 0.14/0.45 # Positive unorientable unit clauses: 0
% 0.14/0.45 # Negative unit clauses : 2
% 0.14/0.45 # Non-unit-clauses : 198
% 0.14/0.45 # Current number of unprocessed clauses: 583
% 0.14/0.45 # ...number of literals in the above : 3869
% 0.14/0.45 # Current number of archived formulas : 0
% 0.14/0.45 # Current number of archived clauses : 275
% 0.14/0.45 # Clause-clause subsumption calls (NU) : 25103
% 0.14/0.45 # Rec. Clause-clause subsumption calls : 6001
% 0.14/0.45 # Non-unit clause-clause subsumptions : 183
% 0.14/0.45 # Unit Clause-clause subsumption calls : 87
% 0.14/0.45 # Rewrite failures with RHS unbound : 0
% 0.14/0.45 # BW rewrite match attempts : 4
% 0.14/0.45 # BW rewrite match successes : 4
% 0.14/0.45 # Condensation attempts : 0
% 0.14/0.45 # Condensation successes : 0
% 0.14/0.45 # Termbank termtop insertions : 35824
% 0.14/0.45 # Search garbage collected termcells : 4315
% 0.14/0.45
% 0.14/0.45 # -------------------------------------------------
% 0.14/0.45 # User time : 0.048 s
% 0.14/0.45 # System time : 0.004 s
% 0.14/0.45 # Total time : 0.052 s
% 0.14/0.45 # Maximum resident set size: 2484 pages
% 0.14/0.45
% 0.14/0.45 # -------------------------------------------------
% 0.14/0.45 # User time : 0.223 s
% 0.14/0.45 # System time : 0.023 s
% 0.14/0.45 # Total time : 0.246 s
% 0.14/0.45 # Maximum resident set size: 1824 pages
% 0.14/0.45 % E---3.1 exiting
% 0.14/0.45 % E exiting
%------------------------------------------------------------------------------