TSTP Solution File: SWC002+1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : SWC002+1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n018.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:40:58 EDT 2023
% Result : Theorem 2.49s 0.81s
% Output : CNFRefutation 2.49s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 1
% Syntax : Number of formulae : 37 ( 13 unt; 0 def)
% Number of atoms : 255 ( 77 equ)
% Maximal formula atoms : 96 ( 6 avg)
% Number of connectives : 370 ( 152 ~; 157 |; 45 &)
% ( 0 <=>; 16 =>; 0 <=; 0 <~>)
% Maximal formula depth : 37 ( 6 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 8 con; 0-3 aty)
% Number of variables : 61 ( 0 sgn; 20 !; 8 ?)
% 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(X6,X7) = X1
& ! [X8] :
( ssItem(X8)
=> ( ~ memberP(X2,X8)
| ~ geq(X8,X5)
| X5 = X8 ) ) ) ) )
| ! [X9] :
( ssItem(X9)
=> ! [X10] :
( ssList(X10)
=> ! [X11] :
( ssList(X11)
=> ( app(app(X10,cons(X9,nil)),X11) != X4
| app(X10,X11) != X3
| ? [X12] :
( ssItem(X12)
& X9 != X12
& memberP(X4,X12)
& geq(X12,X9) ) ) ) ) ) )
& ( ~ neq(X2,nil)
| neq(X4,nil) ) ) ) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.bttu0qtWrY/E---3.1_17147.p',co1) ).
fof(c_0_1,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(X6,X7) = X1
& ! [X8] :
( ssItem(X8)
=> ( ~ memberP(X2,X8)
| ~ geq(X8,X5)
| X5 = X8 ) ) ) ) )
| ! [X9] :
( ssItem(X9)
=> ! [X10] :
( ssList(X10)
=> ! [X11] :
( ssList(X11)
=> ( app(app(X10,cons(X9,nil)),X11) != X4
| app(X10,X11) != X3
| ? [X12] :
( ssItem(X12)
& X9 != X12
& memberP(X4,X12)
& geq(X12,X9) ) ) ) ) ) )
& ( ~ neq(X2,nil)
| neq(X4,nil) ) ) ) ) ) ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[co1])]) ).
fof(c_0_2,negated_conjecture,
! [X17,X18,X19,X24] :
( ssList(esk1_0)
& ssList(esk2_0)
& ssList(esk3_0)
& ssList(esk4_0)
& esk2_0 = esk4_0
& esk1_0 = esk3_0
& ( neq(esk2_0,nil)
| neq(esk2_0,nil) )
& ( ~ neq(esk4_0,nil)
| neq(esk2_0,nil) )
& ( neq(esk2_0,nil)
| ssItem(esk5_3(X17,X18,X19))
| ~ ssList(X19)
| app(app(X18,cons(X17,nil)),X19) != esk2_0
| app(X18,X19) != esk1_0
| ~ ssList(X18)
| ~ ssItem(X17) )
& ( ~ neq(esk4_0,nil)
| ssItem(esk5_3(X17,X18,X19))
| ~ ssList(X19)
| app(app(X18,cons(X17,nil)),X19) != esk2_0
| app(X18,X19) != esk1_0
| ~ ssList(X18)
| ~ ssItem(X17) )
& ( neq(esk2_0,nil)
| memberP(esk2_0,esk5_3(X17,X18,X19))
| ~ ssList(X19)
| app(app(X18,cons(X17,nil)),X19) != esk2_0
| app(X18,X19) != esk1_0
| ~ ssList(X18)
| ~ ssItem(X17) )
& ( ~ neq(esk4_0,nil)
| memberP(esk2_0,esk5_3(X17,X18,X19))
| ~ ssList(X19)
| app(app(X18,cons(X17,nil)),X19) != esk2_0
| app(X18,X19) != esk1_0
| ~ ssList(X18)
| ~ ssItem(X17) )
& ( neq(esk2_0,nil)
| geq(esk5_3(X17,X18,X19),X17)
| ~ ssList(X19)
| app(app(X18,cons(X17,nil)),X19) != esk2_0
| app(X18,X19) != esk1_0
| ~ ssList(X18)
| ~ ssItem(X17) )
& ( ~ neq(esk4_0,nil)
| geq(esk5_3(X17,X18,X19),X17)
| ~ ssList(X19)
| app(app(X18,cons(X17,nil)),X19) != esk2_0
| app(X18,X19) != esk1_0
| ~ ssList(X18)
| ~ ssItem(X17) )
& ( neq(esk2_0,nil)
| X17 != esk5_3(X17,X18,X19)
| ~ ssList(X19)
| app(app(X18,cons(X17,nil)),X19) != esk2_0
| app(X18,X19) != esk1_0
| ~ ssList(X18)
| ~ ssItem(X17) )
& ( ~ neq(esk4_0,nil)
| X17 != esk5_3(X17,X18,X19)
| ~ ssList(X19)
| app(app(X18,cons(X17,nil)),X19) != esk2_0
| app(X18,X19) != esk1_0
| ~ ssList(X18)
| ~ ssItem(X17) )
& ( neq(esk2_0,nil)
| ssItem(esk6_0) )
& ( ~ neq(esk4_0,nil)
| ssItem(esk6_0) )
& ( neq(esk2_0,nil)
| ssList(esk7_0) )
& ( ~ neq(esk4_0,nil)
| ssList(esk7_0) )
& ( neq(esk2_0,nil)
| ssList(esk8_0) )
& ( ~ neq(esk4_0,nil)
| ssList(esk8_0) )
& ( neq(esk2_0,nil)
| app(app(esk7_0,cons(esk6_0,nil)),esk8_0) = esk4_0 )
& ( ~ neq(esk4_0,nil)
| app(app(esk7_0,cons(esk6_0,nil)),esk8_0) = esk4_0 )
& ( neq(esk2_0,nil)
| app(esk7_0,esk8_0) = esk3_0 )
& ( ~ neq(esk4_0,nil)
| app(esk7_0,esk8_0) = esk3_0 )
& ( neq(esk2_0,nil)
| ~ ssItem(X24)
| esk6_0 = X24
| ~ memberP(esk4_0,X24)
| ~ geq(X24,esk6_0) )
& ( ~ neq(esk4_0,nil)
| ~ ssItem(X24)
| esk6_0 = X24
| ~ memberP(esk4_0,X24)
| ~ geq(X24,esk6_0) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_1])])])])]) ).
cnf(c_0_3,negated_conjecture,
( neq(esk2_0,nil)
| neq(esk2_0,nil) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_4,negated_conjecture,
( geq(esk5_3(X1,X2,X3),X1)
| ~ neq(esk4_0,nil)
| ~ ssList(X3)
| app(app(X2,cons(X1,nil)),X3) != esk2_0
| app(X2,X3) != esk1_0
| ~ ssList(X2)
| ~ ssItem(X1) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_5,negated_conjecture,
esk2_0 = esk4_0,
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_6,negated_conjecture,
neq(esk2_0,nil),
inference(cn,[status(thm)],[c_0_3]) ).
cnf(c_0_7,negated_conjecture,
( app(esk7_0,esk8_0) = esk3_0
| ~ neq(esk4_0,nil) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_8,negated_conjecture,
esk1_0 = esk3_0,
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_9,negated_conjecture,
( ssList(esk8_0)
| ~ neq(esk4_0,nil) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_10,negated_conjecture,
( ssList(esk7_0)
| ~ neq(esk4_0,nil) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_11,negated_conjecture,
( memberP(esk2_0,esk5_3(X1,X2,X3))
| ~ neq(esk4_0,nil)
| ~ ssList(X3)
| app(app(X2,cons(X1,nil)),X3) != esk2_0
| app(X2,X3) != esk1_0
| ~ ssList(X2)
| ~ ssItem(X1) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_12,negated_conjecture,
( ssItem(esk5_3(X1,X2,X3))
| ~ neq(esk4_0,nil)
| ~ ssList(X3)
| app(app(X2,cons(X1,nil)),X3) != esk2_0
| app(X2,X3) != esk1_0
| ~ ssList(X2)
| ~ ssItem(X1) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_13,negated_conjecture,
( ~ neq(esk4_0,nil)
| X1 != esk5_3(X1,X2,X3)
| ~ ssList(X3)
| app(app(X2,cons(X1,nil)),X3) != esk2_0
| app(X2,X3) != esk1_0
| ~ ssList(X2)
| ~ ssItem(X1) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_14,negated_conjecture,
( geq(esk5_3(X1,X2,X3),X1)
| app(app(X2,cons(X1,nil)),X3) != esk2_0
| app(X2,X3) != esk1_0
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssItem(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_4,c_0_5]),c_0_6])]) ).
cnf(c_0_15,negated_conjecture,
app(esk7_0,esk8_0) = esk1_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_7,c_0_8]),c_0_5]),c_0_6])]) ).
cnf(c_0_16,negated_conjecture,
ssList(esk8_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_9,c_0_5]),c_0_6])]) ).
cnf(c_0_17,negated_conjecture,
ssList(esk7_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_10,c_0_5]),c_0_6])]) ).
cnf(c_0_18,negated_conjecture,
( app(app(esk7_0,cons(esk6_0,nil)),esk8_0) = esk4_0
| ~ neq(esk4_0,nil) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_19,negated_conjecture,
( ssItem(esk6_0)
| ~ neq(esk4_0,nil) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_20,negated_conjecture,
( memberP(esk2_0,esk5_3(X1,X2,X3))
| app(app(X2,cons(X1,nil)),X3) != esk2_0
| app(X2,X3) != esk1_0
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssItem(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_11,c_0_5]),c_0_6])]) ).
cnf(c_0_21,negated_conjecture,
( ssItem(esk5_3(X1,X2,X3))
| app(app(X2,cons(X1,nil)),X3) != esk2_0
| app(X2,X3) != esk1_0
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssItem(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_12,c_0_5]),c_0_6])]) ).
cnf(c_0_22,negated_conjecture,
( app(app(X1,cons(X2,nil)),X3) != esk2_0
| esk5_3(X2,X1,X3) != X2
| app(X1,X3) != esk1_0
| ~ ssList(X3)
| ~ ssList(X1)
| ~ neq(esk2_0,nil)
| ~ ssItem(X2) ),
inference(rw,[status(thm)],[c_0_13,c_0_5]) ).
cnf(c_0_23,negated_conjecture,
( esk6_0 = X1
| ~ neq(esk4_0,nil)
| ~ ssItem(X1)
| ~ memberP(esk4_0,X1)
| ~ geq(X1,esk6_0) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_24,negated_conjecture,
( geq(esk5_3(X1,esk7_0,esk8_0),X1)
| app(app(esk7_0,cons(X1,nil)),esk8_0) != esk2_0
| ~ ssItem(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_16]),c_0_17])]) ).
cnf(c_0_25,negated_conjecture,
app(app(esk7_0,cons(esk6_0,nil)),esk8_0) = esk2_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_18,c_0_5]),c_0_5]),c_0_6])]) ).
cnf(c_0_26,negated_conjecture,
ssItem(esk6_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_19,c_0_5]),c_0_6])]) ).
cnf(c_0_27,negated_conjecture,
( memberP(esk2_0,esk5_3(X1,esk7_0,esk8_0))
| app(app(esk7_0,cons(X1,nil)),esk8_0) != esk2_0
| ~ ssItem(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_15]),c_0_16]),c_0_17])]) ).
cnf(c_0_28,negated_conjecture,
( ssItem(esk5_3(X1,esk7_0,esk8_0))
| app(app(esk7_0,cons(X1,nil)),esk8_0) != esk2_0
| ~ ssItem(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_15]),c_0_16]),c_0_17])]) ).
cnf(c_0_29,negated_conjecture,
( app(app(X1,cons(X2,nil)),X3) != esk2_0
| esk5_3(X2,X1,X3) != X2
| app(X1,X3) != esk1_0
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssItem(X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_22,c_0_6])]) ).
cnf(c_0_30,negated_conjecture,
( esk6_0 = X1
| ~ geq(X1,esk6_0)
| ~ memberP(esk2_0,X1)
| ~ ssItem(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_23,c_0_5]),c_0_5]),c_0_6])]) ).
cnf(c_0_31,negated_conjecture,
geq(esk5_3(esk6_0,esk7_0,esk8_0),esk6_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_26])]) ).
cnf(c_0_32,negated_conjecture,
memberP(esk2_0,esk5_3(esk6_0,esk7_0,esk8_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_25]),c_0_26])]) ).
cnf(c_0_33,negated_conjecture,
ssItem(esk5_3(esk6_0,esk7_0,esk8_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_25]),c_0_26])]) ).
cnf(c_0_34,negated_conjecture,
( app(app(esk7_0,cons(X1,nil)),esk8_0) != esk2_0
| esk5_3(X1,esk7_0,esk8_0) != X1
| ~ ssItem(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_15]),c_0_16]),c_0_17])]) ).
cnf(c_0_35,negated_conjecture,
esk5_3(esk6_0,esk7_0,esk8_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_32]),c_0_33])]) ).
cnf(c_0_36,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_25]),c_0_26])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SWC002+1 : TPTP v8.1.2. Released v2.4.0.
% 0.13/0.14 % Command : run_E %s %d THM
% 0.13/0.35 % Computer : n018.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 2400
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Tue Oct 3 02:04:39 EDT 2023
% 0.13/0.35 % CPUTime :
% 0.20/0.49 Running first-order model finding
% 0.20/0.49 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/tmp/tmp.bttu0qtWrY/E---3.1_17147.p
% 2.49/0.81 # Version: 3.1pre001
% 2.49/0.81 # Preprocessing class: FSLSSMSSSSSNFFN.
% 2.49/0.81 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.49/0.81 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 2.49/0.81 # Starting new_bool_3 with 300s (1) cores
% 2.49/0.81 # Starting new_bool_1 with 300s (1) cores
% 2.49/0.81 # Starting sh5l with 300s (1) cores
% 2.49/0.81 # sh5l with pid 17228 completed with status 0
% 2.49/0.81 # Result found by sh5l
% 2.49/0.81 # Preprocessing class: FSLSSMSSSSSNFFN.
% 2.49/0.81 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.49/0.81 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 2.49/0.81 # Starting new_bool_3 with 300s (1) cores
% 2.49/0.81 # Starting new_bool_1 with 300s (1) cores
% 2.49/0.81 # Starting sh5l with 300s (1) cores
% 2.49/0.81 # SinE strategy is gf500_gu_R04_F100_L20000
% 2.49/0.81 # Search class: FGHSF-FSLM31-MFFFFFNN
% 2.49/0.81 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 2.49/0.81 # Starting G-E--_110_C45_F1_PI_AE_Q4_CS_SP_PS_S4S with 163s (1) cores
% 2.49/0.81 # G-E--_110_C45_F1_PI_AE_Q4_CS_SP_PS_S4S with pid 17235 completed with status 0
% 2.49/0.81 # Result found by G-E--_110_C45_F1_PI_AE_Q4_CS_SP_PS_S4S
% 2.49/0.81 # Preprocessing class: FSLSSMSSSSSNFFN.
% 2.49/0.81 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.49/0.81 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 2.49/0.81 # Starting new_bool_3 with 300s (1) cores
% 2.49/0.81 # Starting new_bool_1 with 300s (1) cores
% 2.49/0.81 # Starting sh5l with 300s (1) cores
% 2.49/0.81 # SinE strategy is gf500_gu_R04_F100_L20000
% 2.49/0.81 # Search class: FGHSF-FSLM31-MFFFFFNN
% 2.49/0.81 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 2.49/0.81 # Starting G-E--_110_C45_F1_PI_AE_Q4_CS_SP_PS_S4S with 163s (1) cores
% 2.49/0.81 # Preprocessing time : 0.005 s
% 2.49/0.81 # Presaturation interreduction done
% 2.49/0.81
% 2.49/0.81 # Proof found!
% 2.49/0.81 # SZS status Theorem
% 2.49/0.81 # SZS output start CNFRefutation
% See solution above
% 2.49/0.81 # Parsed axioms : 96
% 2.49/0.81 # Removed by relevancy pruning/SinE : 8
% 2.49/0.81 # Initial clauses : 195
% 2.49/0.81 # Removed in clause preprocessing : 2
% 2.49/0.81 # Initial clauses in saturation : 193
% 2.49/0.81 # Processed clauses : 2247
% 2.49/0.81 # ...of these trivial : 33
% 2.49/0.81 # ...subsumed : 1093
% 2.49/0.81 # ...remaining for further processing : 1121
% 2.49/0.81 # Other redundant clauses eliminated : 138
% 2.49/0.81 # Clauses deleted for lack of memory : 0
% 2.49/0.81 # Backward-subsumed : 18
% 2.49/0.81 # Backward-rewritten : 85
% 2.49/0.81 # Generated clauses : 11929
% 2.49/0.81 # ...of the previous two non-redundant : 10893
% 2.49/0.81 # ...aggressively subsumed : 0
% 2.49/0.81 # Contextual simplify-reflections : 237
% 2.49/0.81 # Paramodulations : 11700
% 2.49/0.81 # Factorizations : 0
% 2.49/0.81 # NegExts : 0
% 2.49/0.81 # Equation resolutions : 229
% 2.49/0.81 # Total rewrite steps : 9253
% 2.49/0.81 # Propositional unsat checks : 0
% 2.49/0.81 # Propositional check models : 0
% 2.49/0.81 # Propositional check unsatisfiable : 0
% 2.49/0.81 # Propositional clauses : 0
% 2.49/0.81 # Propositional clauses after purity: 0
% 2.49/0.81 # Propositional unsat core size : 0
% 2.49/0.81 # Propositional preprocessing time : 0.000
% 2.49/0.81 # Propositional encoding time : 0.000
% 2.49/0.81 # Propositional solver time : 0.000
% 2.49/0.81 # Success case prop preproc time : 0.000
% 2.49/0.81 # Success case prop encoding time : 0.000
% 2.49/0.81 # Success case prop solver time : 0.000
% 2.49/0.81 # Current number of processed clauses : 835
% 2.49/0.81 # Positive orientable unit clauses : 114
% 2.49/0.81 # Positive unorientable unit clauses: 0
% 2.49/0.81 # Negative unit clauses : 1
% 2.49/0.81 # Non-unit-clauses : 720
% 2.49/0.81 # Current number of unprocessed clauses: 8851
% 2.49/0.81 # ...number of literals in the above : 53257
% 2.49/0.81 # Current number of archived formulas : 0
% 2.49/0.81 # Current number of archived clauses : 281
% 2.49/0.81 # Clause-clause subsumption calls (NU) : 90324
% 2.49/0.81 # Rec. Clause-clause subsumption calls : 16786
% 2.49/0.81 # Non-unit clause-clause subsumptions : 1348
% 2.49/0.81 # Unit Clause-clause subsumption calls : 4418
% 2.49/0.81 # Rewrite failures with RHS unbound : 0
% 2.49/0.81 # BW rewrite match attempts : 36
% 2.49/0.81 # BW rewrite match successes : 34
% 2.49/0.81 # Condensation attempts : 0
% 2.49/0.81 # Condensation successes : 0
% 2.49/0.81 # Termbank termtop insertions : 244415
% 2.49/0.81
% 2.49/0.81 # -------------------------------------------------
% 2.49/0.81 # User time : 0.252 s
% 2.49/0.81 # System time : 0.014 s
% 2.49/0.81 # Total time : 0.266 s
% 2.49/0.81 # Maximum resident set size: 2496 pages
% 2.49/0.81
% 2.49/0.81 # -------------------------------------------------
% 2.49/0.81 # User time : 0.256 s
% 2.49/0.81 # System time : 0.015 s
% 2.49/0.81 # Total time : 0.271 s
% 2.49/0.81 # Maximum resident set size: 1808 pages
% 2.49/0.81 % E---3.1 exiting
%------------------------------------------------------------------------------