TSTP Solution File: SWC363+1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SWC363+1 : TPTP v8.2.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n017.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:06 EDT 2024
% Result : Theorem 19.98s 3.02s
% Output : CNFRefutation 19.98s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 10
% Syntax : Number of formulae : 59 ( 20 unt; 0 def)
% Number of atoms : 217 ( 38 equ)
% Maximal formula atoms : 18 ( 3 avg)
% Number of connectives : 266 ( 108 ~; 104 |; 26 &)
% ( 2 <=>; 26 =>; 0 <=; 0 <~>)
% Maximal formula depth : 20 ( 5 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 12 ( 12 usr; 6 con; 0-2 aty)
% Number of variables : 82 ( 0 sgn 44 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(co1,conjecture,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ~ neq(X2,nil)
| segmentP(X2,X1)
| ( nil != X3
& nil = X4 )
| ( ! [X5] :
( ssItem(X5)
=> ( cons(X5,nil) != X3
| ~ memberP(X4,X5) ) )
& neq(X4,nil) ) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).
fof(ax7,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( segmentP(X1,X2)
<=> ? [X3] :
( ssList(X3)
& ? [X4] :
( ssList(X4)
& app(app(X3,X2),X4) = X1 ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax7) ).
fof(ax28,axiom,
! [X1] :
( ssList(X1)
=> app(nil,X1) = X1 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax28) ).
fof(ax26,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ssList(app(X1,X2)) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax26) ).
fof(ax84,axiom,
! [X1] :
( ssList(X1)
=> app(X1,nil) = X1 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax84) ).
fof(ax3,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> ( memberP(X1,X2)
<=> ? [X3] :
( ssList(X3)
& ? [X4] :
( ssList(X4)
& app(X3,cons(X2,X4)) = X1 ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax3) ).
fof(ax53,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ( segmentP(X1,X2)
& segmentP(X2,X3) )
=> segmentP(X1,X3) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax53) ).
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(ax16,axiom,
! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> ssList(cons(X2,X1)) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax16) ).
fof(c_0_10,negated_conjecture,
~ ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ( X2 != X4
| X1 != X3
| ~ neq(X2,nil)
| segmentP(X2,X1)
| ( nil != X3
& nil = X4 )
| ( ! [X5] :
( ssItem(X5)
=> ( cons(X5,nil) != X3
| ~ memberP(X4,X5) ) )
& neq(X4,nil) ) ) ) ) ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[co1])]) ).
fof(c_0_11,negated_conjecture,
( ssList(esk1_0)
& ssList(esk2_0)
& ssList(esk3_0)
& ssList(esk4_0)
& esk2_0 = esk4_0
& esk1_0 = esk3_0
& neq(esk2_0,nil)
& ~ segmentP(esk2_0,esk1_0)
& ( nil = esk3_0
| nil != esk4_0 )
& ( ssItem(esk5_0)
| ~ neq(esk4_0,nil) )
& ( cons(esk5_0,nil) = esk3_0
| ~ neq(esk4_0,nil) )
& ( memberP(esk4_0,esk5_0)
| ~ neq(esk4_0,nil) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_10])])])])]) ).
fof(c_0_12,plain,
! [X65,X66,X69,X70] :
( ( ssList(esk12_2(X65,X66))
| ~ segmentP(X65,X66)
| ~ ssList(X66)
| ~ ssList(X65) )
& ( ssList(esk13_2(X65,X66))
| ~ segmentP(X65,X66)
| ~ ssList(X66)
| ~ ssList(X65) )
& ( app(app(esk12_2(X65,X66),X66),esk13_2(X65,X66)) = X65
| ~ segmentP(X65,X66)
| ~ ssList(X66)
| ~ ssList(X65) )
& ( ~ ssList(X69)
| ~ ssList(X70)
| app(app(X69,X66),X70) != X65
| segmentP(X65,X66)
| ~ ssList(X66)
| ~ ssList(X65) ) ),
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)],[ax7])])])])])]) ).
cnf(c_0_13,negated_conjecture,
neq(esk2_0,nil),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_14,negated_conjecture,
esk2_0 = esk4_0,
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_15,plain,
( segmentP(X4,X3)
| ~ ssList(X1)
| ~ ssList(X2)
| app(app(X1,X3),X2) != X4
| ~ ssList(X3)
| ~ ssList(X4) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
fof(c_0_16,plain,
! [X21] :
( ~ ssList(X21)
| app(nil,X21) = X21 ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax28])])]) ).
fof(c_0_17,plain,
! [X83,X84] :
( ~ ssList(X83)
| ~ ssList(X84)
| ssList(app(X83,X84)) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax26])])])]) ).
fof(c_0_18,plain,
! [X26] :
( ~ ssList(X26)
| app(X26,nil) = X26 ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax84])])]) ).
fof(c_0_19,plain,
! [X27,X28,X31,X32] :
( ( ssList(esk8_2(X27,X28))
| ~ memberP(X27,X28)
| ~ ssItem(X28)
| ~ ssList(X27) )
& ( ssList(esk9_2(X27,X28))
| ~ memberP(X27,X28)
| ~ ssItem(X28)
| ~ ssList(X27) )
& ( app(esk8_2(X27,X28),cons(X28,esk9_2(X27,X28))) = X27
| ~ memberP(X27,X28)
| ~ ssItem(X28)
| ~ ssList(X27) )
& ( ~ ssList(X31)
| ~ ssList(X32)
| app(X31,cons(X28,X32)) != X27
| memberP(X27,X28)
| ~ ssItem(X28)
| ~ ssList(X27) ) ),
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)],[ax3])])])])])]) ).
cnf(c_0_20,negated_conjecture,
( memberP(esk4_0,esk5_0)
| ~ neq(esk4_0,nil) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_21,negated_conjecture,
neq(esk4_0,nil),
inference(rw,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_22,negated_conjecture,
ssList(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_23,negated_conjecture,
( ssItem(esk5_0)
| ~ neq(esk4_0,nil) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
fof(c_0_24,plain,
! [X71,X72,X73] :
( ~ ssList(X71)
| ~ ssList(X72)
| ~ ssList(X73)
| ~ segmentP(X71,X72)
| ~ segmentP(X72,X73)
| segmentP(X71,X73) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax53])])])]) ).
cnf(c_0_25,plain,
( segmentP(app(app(X1,X2),X3),X2)
| ~ ssList(app(app(X1,X2),X3))
| ~ ssList(X2)
| ~ ssList(X3)
| ~ ssList(X1) ),
inference(er,[status(thm)],[c_0_15]) ).
cnf(c_0_26,plain,
( app(nil,X1) = X1
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_27,plain,
ssList(nil),
inference(split_conjunct,[status(thm)],[ax17]) ).
cnf(c_0_28,plain,
( ssList(app(X1,X2))
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
fof(c_0_29,plain,
! [X22,X23] :
( ~ ssList(X22)
| ~ ssItem(X23)
| cons(X23,X22) = app(cons(X23,nil),X22) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax81])])])]) ).
cnf(c_0_30,negated_conjecture,
( cons(esk5_0,nil) = esk3_0
| ~ neq(esk4_0,nil) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_31,plain,
( app(X1,nil) = X1
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_32,plain,
( app(esk8_2(X1,X2),cons(X2,esk9_2(X1,X2))) = X1
| ~ memberP(X1,X2)
| ~ ssItem(X2)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_33,negated_conjecture,
memberP(esk4_0,esk5_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_20,c_0_21])]) ).
cnf(c_0_34,negated_conjecture,
ssList(esk4_0),
inference(rw,[status(thm)],[c_0_22,c_0_14]) ).
cnf(c_0_35,negated_conjecture,
ssItem(esk5_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_23,c_0_21])]) ).
cnf(c_0_36,plain,
( ssList(esk8_2(X1,X2))
| ~ memberP(X1,X2)
| ~ ssItem(X2)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_37,plain,
( segmentP(X1,X3)
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3)
| ~ segmentP(X1,X2)
| ~ segmentP(X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_38,plain,
( segmentP(app(X1,X2),X1)
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_27])]),c_0_28]) ).
cnf(c_0_39,plain,
( cons(X2,X1) = app(cons(X2,nil),X1)
| ~ ssList(X1)
| ~ ssItem(X2) ),
inference(split_conjunct,[status(thm)],[c_0_29]) ).
cnf(c_0_40,negated_conjecture,
cons(esk5_0,nil) = esk3_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_30,c_0_21])]) ).
cnf(c_0_41,negated_conjecture,
ssList(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_42,negated_conjecture,
esk1_0 = esk3_0,
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_43,plain,
( segmentP(app(X1,X2),X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_31]),c_0_27])]),c_0_28]) ).
cnf(c_0_44,negated_conjecture,
app(esk8_2(esk4_0,esk5_0),cons(esk5_0,esk9_2(esk4_0,esk5_0))) = esk4_0,
inference(cn,[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])]) ).
cnf(c_0_45,negated_conjecture,
ssList(esk8_2(esk4_0,esk5_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_33]),c_0_34]),c_0_35])]) ).
fof(c_0_46,plain,
! [X40,X41] :
( ~ ssList(X40)
| ~ ssItem(X41)
| ssList(cons(X41,X40)) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax16])])])]) ).
cnf(c_0_47,plain,
( ssList(esk9_2(X1,X2))
| ~ memberP(X1,X2)
| ~ ssItem(X2)
| ~ ssList(X1) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_48,plain,
( segmentP(X1,X2)
| ~ segmentP(X1,app(X2,X3))
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(X3) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_38]),c_0_28]) ).
cnf(c_0_49,negated_conjecture,
( app(esk3_0,X1) = cons(esk5_0,X1)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_40]),c_0_35])]) ).
cnf(c_0_50,negated_conjecture,
ssList(esk3_0),
inference(rw,[status(thm)],[c_0_41,c_0_42]) ).
cnf(c_0_51,negated_conjecture,
( segmentP(esk4_0,cons(esk5_0,esk9_2(esk4_0,esk5_0)))
| ~ ssList(cons(esk5_0,esk9_2(esk4_0,esk5_0))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_44]),c_0_45])]) ).
cnf(c_0_52,plain,
( ssList(cons(X2,X1))
| ~ ssList(X1)
| ~ ssItem(X2) ),
inference(split_conjunct,[status(thm)],[c_0_46]) ).
cnf(c_0_53,negated_conjecture,
ssList(esk9_2(esk4_0,esk5_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_33]),c_0_34]),c_0_35])]) ).
cnf(c_0_54,negated_conjecture,
~ segmentP(esk2_0,esk1_0),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_55,negated_conjecture,
( segmentP(X1,esk3_0)
| ~ segmentP(X1,cons(esk5_0,X2))
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_49]),c_0_50])]) ).
cnf(c_0_56,negated_conjecture,
segmentP(esk4_0,cons(esk5_0,esk9_2(esk4_0,esk5_0))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_52]),c_0_53]),c_0_35])]) ).
cnf(c_0_57,negated_conjecture,
~ segmentP(esk4_0,esk3_0),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_54,c_0_14]),c_0_42]) ).
cnf(c_0_58,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_55,c_0_56]),c_0_34]),c_0_53])]),c_0_57]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : SWC363+1 : TPTP v8.2.0. Released v2.4.0.
% 0.07/0.14 % Command : run_E %s %d THM
% 0.13/0.35 % Computer : n017.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 : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Sun May 19 03:39:08 EDT 2024
% 0.13/0.35 % CPUTime :
% 0.20/0.49 Running first-order theorem proving
% 0.20/0.49 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/benchmark/theBenchmark.p
% 19.98/3.02 # Version: 3.1.0
% 19.98/3.02 # Preprocessing class: FSLSSMSSSSSNFFN.
% 19.98/3.02 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 19.98/3.02 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 19.98/3.02 # Starting new_bool_3 with 300s (1) cores
% 19.98/3.02 # Starting new_bool_1 with 300s (1) cores
% 19.98/3.02 # Starting sh5l with 300s (1) cores
% 19.98/3.02 # sh5l with pid 8057 completed with status 0
% 19.98/3.02 # Result found by sh5l
% 19.98/3.02 # Preprocessing class: FSLSSMSSSSSNFFN.
% 19.98/3.02 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 19.98/3.02 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 19.98/3.02 # Starting new_bool_3 with 300s (1) cores
% 19.98/3.02 # Starting new_bool_1 with 300s (1) cores
% 19.98/3.02 # Starting sh5l with 300s (1) cores
% 19.98/3.02 # SinE strategy is gf500_gu_R04_F100_L20000
% 19.98/3.02 # Search class: FGHSF-FSLM21-MFFFFFNN
% 19.98/3.02 # Scheduled 11 strats onto 1 cores with 300 seconds (300 total)
% 19.98/3.02 # Starting G-E--_208_C18_SOS_F1_SE_CS_SP_PS_S4c with 28s (1) cores
% 19.98/3.02 # G-E--_208_C18_SOS_F1_SE_CS_SP_PS_S4c with pid 8062 completed with status 0
% 19.98/3.02 # Result found by G-E--_208_C18_SOS_F1_SE_CS_SP_PS_S4c
% 19.98/3.02 # Preprocessing class: FSLSSMSSSSSNFFN.
% 19.98/3.02 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 19.98/3.02 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 19.98/3.02 # Starting new_bool_3 with 300s (1) cores
% 19.98/3.02 # Starting new_bool_1 with 300s (1) cores
% 19.98/3.02 # Starting sh5l with 300s (1) cores
% 19.98/3.02 # SinE strategy is gf500_gu_R04_F100_L20000
% 19.98/3.02 # Search class: FGHSF-FSLM21-MFFFFFNN
% 19.98/3.02 # Scheduled 11 strats onto 1 cores with 300 seconds (300 total)
% 19.98/3.02 # Starting G-E--_208_C18_SOS_F1_SE_CS_SP_PS_S4c with 28s (1) cores
% 19.98/3.02 # Preprocessing time : 0.003 s
% 19.98/3.02 # Presaturation interreduction done
% 19.98/3.02
% 19.98/3.02 # Proof found!
% 19.98/3.02 # SZS status Theorem
% 19.98/3.02 # SZS output start CNFRefutation
% See solution above
% 19.98/3.02 # Parsed axioms : 96
% 19.98/3.02 # Removed by relevancy pruning/SinE : 8
% 19.98/3.02 # Initial clauses : 179
% 19.98/3.02 # Removed in clause preprocessing : 2
% 19.98/3.02 # Initial clauses in saturation : 177
% 19.98/3.02 # Processed clauses : 19138
% 19.98/3.02 # ...of these trivial : 216
% 19.98/3.02 # ...subsumed : 14502
% 19.98/3.02 # ...remaining for further processing : 4420
% 19.98/3.02 # Other redundant clauses eliminated : 485
% 19.98/3.02 # Clauses deleted for lack of memory : 0
% 19.98/3.02 # Backward-subsumed : 211
% 19.98/3.02 # Backward-rewritten : 394
% 19.98/3.02 # Generated clauses : 119473
% 19.98/3.02 # ...of the previous two non-redundant : 108790
% 19.98/3.02 # ...aggressively subsumed : 0
% 19.98/3.02 # Contextual simplify-reflections : 1301
% 19.98/3.02 # Paramodulations : 118963
% 19.98/3.02 # Factorizations : 4
% 19.98/3.02 # NegExts : 0
% 19.98/3.02 # Equation resolutions : 507
% 19.98/3.02 # Disequality decompositions : 0
% 19.98/3.02 # Total rewrite steps : 141124
% 19.98/3.02 # ...of those cached : 140570
% 19.98/3.02 # Propositional unsat checks : 0
% 19.98/3.02 # Propositional check models : 0
% 19.98/3.02 # Propositional check unsatisfiable : 0
% 19.98/3.02 # Propositional clauses : 0
% 19.98/3.02 # Propositional clauses after purity: 0
% 19.98/3.02 # Propositional unsat core size : 0
% 19.98/3.02 # Propositional preprocessing time : 0.000
% 19.98/3.02 # Propositional encoding time : 0.000
% 19.98/3.02 # Propositional solver time : 0.000
% 19.98/3.02 # Success case prop preproc time : 0.000
% 19.98/3.02 # Success case prop encoding time : 0.000
% 19.98/3.02 # Success case prop solver time : 0.000
% 19.98/3.02 # Current number of processed clauses : 3624
% 19.98/3.02 # Positive orientable unit clauses : 598
% 19.98/3.02 # Positive unorientable unit clauses: 0
% 19.98/3.02 # Negative unit clauses : 489
% 19.98/3.02 # Non-unit-clauses : 2537
% 19.98/3.02 # Current number of unprocessed clauses: 88707
% 19.98/3.02 # ...number of literals in the above : 544117
% 19.98/3.02 # Current number of archived formulas : 0
% 19.98/3.02 # Current number of archived clauses : 776
% 19.98/3.02 # Clause-clause subsumption calls (NU) : 1616302
% 19.98/3.02 # Rec. Clause-clause subsumption calls : 325885
% 19.98/3.02 # Non-unit clause-clause subsumptions : 8350
% 19.98/3.02 # Unit Clause-clause subsumption calls : 90922
% 19.98/3.02 # Rewrite failures with RHS unbound : 0
% 19.98/3.02 # BW rewrite match attempts : 1867
% 19.98/3.02 # BW rewrite match successes : 140
% 19.98/3.02 # Condensation attempts : 0
% 19.98/3.02 # Condensation successes : 0
% 19.98/3.02 # Termbank termtop insertions : 3140364
% 19.98/3.02 # Search garbage collected termcells : 3872
% 19.98/3.02
% 19.98/3.02 # -------------------------------------------------
% 19.98/3.02 # User time : 2.329 s
% 19.98/3.02 # System time : 0.060 s
% 19.98/3.02 # Total time : 2.389 s
% 19.98/3.02 # Maximum resident set size: 2424 pages
% 19.98/3.02
% 19.98/3.02 # -------------------------------------------------
% 19.98/3.02 # User time : 2.332 s
% 19.98/3.02 # System time : 0.062 s
% 19.98/3.02 # Total time : 2.394 s
% 19.98/3.02 # Maximum resident set size: 1820 pages
% 19.98/3.02 % E---3.1 exiting
% 19.98/3.02 % E exiting
%------------------------------------------------------------------------------