TSTP Solution File: SWV486+3 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : SWV486+3 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n019.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:47:18 EDT 2023
% Result : Theorem 246.20s 31.58s
% Output : CNFRefutation 246.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 11
% Syntax : Number of formulae : 64 ( 17 unt; 0 def)
% Number of atoms : 220 ( 55 equ)
% Maximal formula atoms : 17 ( 3 avg)
% Number of connectives : 241 ( 85 ~; 87 |; 43 &)
% ( 3 <=>; 23 =>; 0 <=; 0 <~>)
% Maximal formula depth : 16 ( 4 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 7 con; 0-2 aty)
% Number of variables : 137 ( 0 sgn; 75 !; 1 ?)
% Comments :
%------------------------------------------------------------------------------
fof(int_less_transitive,axiom,
! [X1,X2,X3] :
( ( int_less(X1,X2)
& int_less(X2,X3) )
=> int_less(X1,X3) ),
file('/export/starexec/sandbox2/tmp/tmp.k94BX2zABT/E---3.1_29030.p',int_less_transitive) ).
fof(int_leq,axiom,
! [X1,X2] :
( int_leq(X1,X2)
<=> ( int_less(X1,X2)
| X1 = X2 ) ),
file('/export/starexec/sandbox2/tmp/tmp.k94BX2zABT/E---3.1_29030.p',int_leq) ).
fof(lt,conjecture,
! [X1,X2] :
( ( int_leq(int_one,X1)
& int_less(X1,X2)
& int_leq(X2,n) )
=> a(X1,X2) = real_zero ),
file('/export/starexec/sandbox2/tmp/tmp.k94BX2zABT/E---3.1_29030.p',lt) ).
fof(plus_and_order1,axiom,
! [X4,X5,X6,X7] :
( ( int_less(X4,X5)
& int_leq(X6,X7) )
=> int_leq(plus(X4,X6),plus(X5,X7)) ),
file('/export/starexec/sandbox2/tmp/tmp.k94BX2zABT/E---3.1_29030.p',plus_and_order1) ).
fof(plus_commutative,axiom,
! [X1,X2] : plus(X1,X2) = plus(X2,X1),
file('/export/starexec/sandbox2/tmp/tmp.k94BX2zABT/E---3.1_29030.p',plus_commutative) ).
fof(int_less_irreflexive,axiom,
! [X1,X2] :
( int_less(X1,X2)
=> X1 != X2 ),
file('/export/starexec/sandbox2/tmp/tmp.k94BX2zABT/E---3.1_29030.p',int_less_irreflexive) ).
fof(plus_and_inverse,axiom,
! [X1,X2] :
( int_less(X1,X2)
<=> ? [X3] :
( plus(X1,X3) = X2
& int_less(int_zero,X3) ) ),
file('/export/starexec/sandbox2/tmp/tmp.k94BX2zABT/E---3.1_29030.p',plus_and_inverse) ).
fof(plus_zero,axiom,
! [X1] : plus(X1,int_zero) = X1,
file('/export/starexec/sandbox2/tmp/tmp.k94BX2zABT/E---3.1_29030.p',plus_zero) ).
fof(qii,hypothesis,
! [X1,X2] :
( ( int_leq(int_one,X1)
& int_leq(X1,n)
& int_leq(int_one,X2)
& int_leq(X2,n) )
=> ( ! [X8] :
( ( int_less(int_zero,X8)
& X1 = plus(X2,X8) )
=> ! [X3] :
( ( int_leq(int_one,X3)
& int_leq(X3,X2) )
=> a(plus(X3,X8),X3) = real_zero ) )
& ! [X3] :
( ( int_leq(int_one,X3)
& int_leq(X3,X2) )
=> a(X3,X3) = real_one )
& ! [X8] :
( ( int_less(int_zero,X8)
& X2 = plus(X1,X8) )
=> ! [X3] :
( ( int_leq(int_one,X3)
& int_leq(X3,X1) )
=> a(X3,plus(X3,X8)) = real_zero ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.k94BX2zABT/E---3.1_29030.p',qii) ).
fof(int_less_total,axiom,
! [X1,X2] :
( int_less(X1,X2)
| int_leq(X2,X1) ),
file('/export/starexec/sandbox2/tmp/tmp.k94BX2zABT/E---3.1_29030.p',int_less_total) ).
fof(c_0_10,plain,
! [X2,X1] :
( epred1_2(X1,X2)
<=> ( ! [X8] :
( ( int_less(int_zero,X8)
& X1 = plus(X2,X8) )
=> ! [X3] :
( ( int_leq(int_one,X3)
& int_leq(X3,X2) )
=> a(plus(X3,X8),X3) = real_zero ) )
& ! [X3] :
( ( int_leq(int_one,X3)
& int_leq(X3,X2) )
=> a(X3,X3) = real_one )
& ! [X8] :
( ( int_less(int_zero,X8)
& X2 = plus(X1,X8) )
=> ! [X3] :
( ( int_leq(int_one,X3)
& int_leq(X3,X1) )
=> a(X3,plus(X3,X8)) = real_zero ) ) ) ),
introduced(definition) ).
fof(c_0_11,plain,
! [X2,X1] :
( epred1_2(X1,X2)
=> ( ! [X8] :
( ( int_less(int_zero,X8)
& X1 = plus(X2,X8) )
=> ! [X3] :
( ( int_leq(int_one,X3)
& int_leq(X3,X2) )
=> a(plus(X3,X8),X3) = real_zero ) )
& ! [X3] :
( ( int_leq(int_one,X3)
& int_leq(X3,X2) )
=> a(X3,X3) = real_one )
& ! [X8] :
( ( int_less(int_zero,X8)
& X2 = plus(X1,X8) )
=> ! [X3] :
( ( int_leq(int_one,X3)
& int_leq(X3,X1) )
=> a(X3,plus(X3,X8)) = real_zero ) ) ) ),
inference(split_equiv,[status(thm)],[c_0_10]) ).
fof(c_0_12,plain,
! [X11,X12,X13] :
( ~ int_less(X11,X12)
| ~ int_less(X12,X13)
| int_less(X11,X13) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[int_less_transitive])]) ).
fof(c_0_13,plain,
! [X9,X10] :
( ( ~ int_leq(X9,X10)
| int_less(X9,X10)
| X9 = X10 )
& ( ~ int_less(X9,X10)
| int_leq(X9,X10) )
& ( X9 != X10
| int_leq(X9,X10) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[int_leq])])]) ).
fof(c_0_14,negated_conjecture,
~ ! [X1,X2] :
( ( int_leq(int_one,X1)
& int_less(X1,X2)
& int_leq(X2,n) )
=> a(X1,X2) = real_zero ),
inference(assume_negation,[status(cth)],[lt]) ).
fof(c_0_15,plain,
! [X36,X37,X38,X39,X40,X41,X42] :
( ( ~ int_less(int_zero,X38)
| X37 != plus(X36,X38)
| ~ int_leq(int_one,X39)
| ~ int_leq(X39,X36)
| a(plus(X39,X38),X39) = real_zero
| ~ epred1_2(X37,X36) )
& ( ~ int_leq(int_one,X40)
| ~ int_leq(X40,X36)
| a(X40,X40) = real_one
| ~ epred1_2(X37,X36) )
& ( ~ int_less(int_zero,X41)
| X36 != plus(X37,X41)
| ~ int_leq(int_one,X42)
| ~ int_leq(X42,X37)
| a(X42,plus(X42,X41)) = real_zero
| ~ epred1_2(X37,X36) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_11])])])]) ).
fof(c_0_16,plain,
! [X21,X22,X23,X24] :
( ~ int_less(X21,X22)
| ~ int_leq(X23,X24)
| int_leq(plus(X21,X23),plus(X22,X24)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[plus_and_order1])]) ).
fof(c_0_17,plain,
! [X18,X19] : plus(X18,X19) = plus(X19,X18),
inference(variable_rename,[status(thm)],[plus_commutative]) ).
fof(c_0_18,plain,
! [X14,X15] :
( ~ int_less(X14,X15)
| X14 != X15 ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[int_less_irreflexive])]) ).
cnf(c_0_19,plain,
( int_less(X1,X3)
| ~ int_less(X1,X2)
| ~ int_less(X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_20,plain,
( int_less(X1,X2)
| X1 = X2
| ~ int_leq(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
fof(c_0_21,negated_conjecture,
( int_leq(int_one,esk2_0)
& int_less(esk2_0,esk3_0)
& int_leq(esk3_0,n)
& a(esk2_0,esk3_0) != real_zero ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_14])])]) ).
cnf(c_0_22,plain,
( a(X4,plus(X4,X1)) = real_zero
| ~ int_less(int_zero,X1)
| X2 != plus(X3,X1)
| ~ int_leq(int_one,X4)
| ~ int_leq(X4,X3)
| ~ epred1_2(X3,X2) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
fof(c_0_23,plain,
! [X25,X26,X28,X29,X30] :
( ( plus(X25,esk1_2(X25,X26)) = X26
| ~ int_less(X25,X26) )
& ( int_less(int_zero,esk1_2(X25,X26))
| ~ int_less(X25,X26) )
& ( plus(X28,X30) != X29
| ~ int_less(int_zero,X30)
| int_less(X28,X29) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[plus_and_inverse])])])])])]) ).
cnf(c_0_24,plain,
( int_leq(plus(X1,X3),plus(X2,X4))
| ~ int_less(X1,X2)
| ~ int_leq(X3,X4) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_25,plain,
plus(X1,X2) = plus(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
fof(c_0_26,plain,
! [X20] : plus(X20,int_zero) = X20,
inference(variable_rename,[status(thm)],[plus_zero]) ).
cnf(c_0_27,plain,
( ~ int_less(X1,X2)
| X1 != X2 ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_28,plain,
( X1 = X2
| int_less(X3,X2)
| ~ int_less(X3,X1)
| ~ int_leq(X1,X2) ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_29,negated_conjecture,
int_leq(esk3_0,n),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_30,negated_conjecture,
int_less(esk2_0,esk3_0),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_31,plain,
( a(X1,plus(X1,X2)) = real_zero
| ~ epred1_2(X3,plus(X3,X2))
| ~ int_less(int_zero,X2)
| ~ int_leq(int_one,X1)
| ~ int_leq(X1,X3) ),
inference(er,[status(thm)],[c_0_22]) ).
cnf(c_0_32,plain,
( plus(X1,esk1_2(X1,X2)) = X2
| ~ int_less(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_33,plain,
( int_less(int_zero,esk1_2(X1,X2))
| ~ int_less(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_34,plain,
( int_leq(X1,X2)
| X1 != X2 ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
fof(c_0_35,hypothesis,
! [X1,X2] :
( ( int_leq(int_one,X1)
& int_leq(X1,n)
& int_leq(int_one,X2)
& int_leq(X2,n) )
=> epred1_2(X1,X2) ),
inference(apply_def,[status(thm)],[qii,c_0_10]) ).
cnf(c_0_36,plain,
( int_leq(plus(X1,X2),plus(X3,X4))
| ~ int_less(X1,X4)
| ~ int_leq(X2,X3) ),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_37,plain,
plus(X1,int_zero) = X1,
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_38,plain,
~ int_less(X1,X1),
inference(er,[status(thm)],[c_0_27]) ).
cnf(c_0_39,negated_conjecture,
( n = esk3_0
| int_less(X1,n)
| ~ int_less(X1,esk3_0) ),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_40,plain,
( int_leq(X1,X2)
| ~ int_less(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_41,negated_conjecture,
( int_less(X1,esk3_0)
| ~ int_less(X1,esk2_0) ),
inference(spm,[status(thm)],[c_0_19,c_0_30]) ).
fof(c_0_42,plain,
! [X16,X17] :
( int_less(X16,X17)
| int_leq(X17,X16) ),
inference(variable_rename,[status(thm)],[int_less_total]) ).
cnf(c_0_43,plain,
( a(X1,plus(X1,esk1_2(X2,X3))) = real_zero
| ~ epred1_2(X2,X3)
| ~ int_less(X2,X3)
| ~ int_leq(int_one,X1)
| ~ int_leq(X1,X2) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_33]) ).
cnf(c_0_44,plain,
int_leq(X1,X1),
inference(er,[status(thm)],[c_0_34]) ).
fof(c_0_45,hypothesis,
! [X32,X33] :
( ~ int_leq(int_one,X32)
| ~ int_leq(X32,n)
| ~ int_leq(int_one,X33)
| ~ int_leq(X33,n)
| epred1_2(X32,X33) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_35])]) ).
cnf(c_0_46,plain,
( int_leq(plus(X1,X2),X3)
| ~ int_less(X1,esk1_2(X4,X3))
| ~ int_less(X4,X3)
| ~ int_leq(X2,X4) ),
inference(spm,[status(thm)],[c_0_36,c_0_32]) ).
cnf(c_0_47,plain,
plus(int_zero,X1) = X1,
inference(spm,[status(thm)],[c_0_37,c_0_25]) ).
cnf(c_0_48,negated_conjecture,
( n = esk3_0
| ~ int_less(n,esk3_0) ),
inference(spm,[status(thm)],[c_0_38,c_0_39]) ).
cnf(c_0_49,negated_conjecture,
( int_leq(X1,esk3_0)
| ~ int_less(X1,esk2_0) ),
inference(spm,[status(thm)],[c_0_40,c_0_41]) ).
cnf(c_0_50,plain,
( int_less(X1,X2)
| int_leq(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_42]) ).
cnf(c_0_51,plain,
( a(X1,X2) = real_zero
| ~ epred1_2(X1,X2)
| ~ int_less(X1,X2)
| ~ int_leq(int_one,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_32]),c_0_44])]) ).
cnf(c_0_52,hypothesis,
( epred1_2(X1,X2)
| ~ int_leq(int_one,X1)
| ~ int_leq(X1,n)
| ~ int_leq(int_one,X2)
| ~ int_leq(X2,n) ),
inference(split_conjunct,[status(thm)],[c_0_45]) ).
cnf(c_0_53,plain,
( int_leq(X1,X2)
| ~ int_less(X3,X2)
| ~ int_leq(X1,X3) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_33]),c_0_47]) ).
cnf(c_0_54,negated_conjecture,
( n = esk3_0
| ~ int_leq(n,esk3_0) ),
inference(spm,[status(thm)],[c_0_48,c_0_20]) ).
cnf(c_0_55,negated_conjecture,
( int_leq(esk2_0,X1)
| int_leq(X1,esk3_0) ),
inference(spm,[status(thm)],[c_0_49,c_0_50]) ).
cnf(c_0_56,negated_conjecture,
a(esk2_0,esk3_0) != real_zero,
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_57,hypothesis,
( a(X1,X2) = real_zero
| ~ int_less(X1,X2)
| ~ int_leq(int_one,X1)
| ~ int_leq(X2,n)
| ~ int_leq(X1,n) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_52]),c_0_53]) ).
cnf(c_0_58,negated_conjecture,
int_leq(int_one,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_59,negated_conjecture,
( n = esk3_0
| int_leq(esk2_0,n) ),
inference(spm,[status(thm)],[c_0_54,c_0_55]) ).
cnf(c_0_60,negated_conjecture,
~ int_leq(esk2_0,n),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_56,c_0_57]),c_0_30]),c_0_58]),c_0_29])]) ).
cnf(c_0_61,negated_conjecture,
n = esk3_0,
inference(sr,[status(thm)],[c_0_59,c_0_60]) ).
cnf(c_0_62,negated_conjecture,
int_leq(esk2_0,esk3_0),
inference(spm,[status(thm)],[c_0_40,c_0_30]) ).
cnf(c_0_63,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_60,c_0_61]),c_0_62])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.10 % Problem : SWV486+3 : TPTP v8.1.2. Released v4.0.0.
% 0.02/0.11 % Command : run_E %s %d THM
% 0.11/0.31 % Computer : n019.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 03:44:21 EDT 2023
% 0.11/0.32 % 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.k94BX2zABT/E---3.1_29030.p
% 246.20/31.58 # Version: 3.1pre001
% 246.20/31.58 # Preprocessing class: FSMSSMSSSSSNFFN.
% 246.20/31.58 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 246.20/31.58 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 246.20/31.58 # Starting new_bool_3 with 300s (1) cores
% 246.20/31.58 # Starting new_bool_1 with 300s (1) cores
% 246.20/31.58 # Starting sh5l with 300s (1) cores
% 246.20/31.58 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 29109 completed with status 0
% 246.20/31.58 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 246.20/31.58 # Preprocessing class: FSMSSMSSSSSNFFN.
% 246.20/31.58 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 246.20/31.58 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 246.20/31.58 # No SInE strategy applied
% 246.20/31.58 # Search class: FGHSS-FFMS22-SFFFFFNN
% 246.20/31.58 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 246.20/31.58 # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 246.20/31.58 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 246.20/31.58 # Starting new_bool_3 with 136s (1) cores
% 246.20/31.58 # Starting new_bool_1 with 136s (1) cores
% 246.20/31.58 # Starting sh5l with 136s (1) cores
% 246.20/31.58 # SAT001_MinMin_p005000_rr_RG with pid 29113 completed with status 0
% 246.20/31.58 # Result found by SAT001_MinMin_p005000_rr_RG
% 246.20/31.58 # Preprocessing class: FSMSSMSSSSSNFFN.
% 246.20/31.58 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 246.20/31.58 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 246.20/31.58 # No SInE strategy applied
% 246.20/31.58 # Search class: FGHSS-FFMS22-SFFFFFNN
% 246.20/31.58 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 246.20/31.58 # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 246.20/31.58 # Preprocessing time : 0.001 s
% 246.20/31.58 # Presaturation interreduction done
% 246.20/31.58
% 246.20/31.58 # Proof found!
% 246.20/31.58 # SZS status Theorem
% 246.20/31.58 # SZS output start CNFRefutation
% See solution above
% 246.20/31.58 # Parsed axioms : 13
% 246.20/31.58 # Removed by relevancy pruning/SinE : 0
% 246.20/31.58 # Initial clauses : 24
% 246.20/31.58 # Removed in clause preprocessing : 0
% 246.20/31.58 # Initial clauses in saturation : 24
% 246.20/31.58 # Processed clauses : 62907
% 246.20/31.58 # ...of these trivial : 214
% 246.20/31.58 # ...subsumed : 56576
% 246.20/31.58 # ...remaining for further processing : 6117
% 246.20/31.58 # Other redundant clauses eliminated : 27
% 246.20/31.58 # Clauses deleted for lack of memory : 0
% 246.20/31.58 # Backward-subsumed : 690
% 246.20/31.58 # Backward-rewritten : 1547
% 246.20/31.58 # Generated clauses : 1381051
% 246.20/31.58 # ...of the previous two non-redundant : 1168872
% 246.20/31.58 # ...aggressively subsumed : 0
% 246.20/31.58 # Contextual simplify-reflections : 172
% 246.20/31.58 # Paramodulations : 1380834
% 246.20/31.58 # Factorizations : 177
% 246.20/31.58 # NegExts : 0
% 246.20/31.58 # Equation resolutions : 27
% 246.20/31.58 # Total rewrite steps : 311582
% 246.20/31.58 # Propositional unsat checks : 1
% 246.20/31.58 # Propositional check models : 1
% 246.20/31.58 # Propositional check unsatisfiable : 0
% 246.20/31.58 # Propositional clauses : 0
% 246.20/31.58 # Propositional clauses after purity: 0
% 246.20/31.58 # Propositional unsat core size : 0
% 246.20/31.58 # Propositional preprocessing time : 0.000
% 246.20/31.58 # Propositional encoding time : 1.124
% 246.20/31.58 # Propositional solver time : 0.083
% 246.20/31.58 # Success case prop preproc time : 0.000
% 246.20/31.58 # Success case prop encoding time : 0.000
% 246.20/31.58 # Success case prop solver time : 0.000
% 246.20/31.58 # Current number of processed clauses : 3838
% 246.20/31.58 # Positive orientable unit clauses : 13
% 246.20/31.58 # Positive unorientable unit clauses: 1
% 246.20/31.58 # Negative unit clauses : 9
% 246.20/31.58 # Non-unit-clauses : 3815
% 246.20/31.58 # Current number of unprocessed clauses: 1101198
% 246.20/31.58 # ...number of literals in the above : 7831389
% 246.20/31.58 # Current number of archived formulas : 0
% 246.20/31.58 # Current number of archived clauses : 2274
% 246.20/31.58 # Clause-clause subsumption calls (NU) : 4108787
% 246.20/31.58 # Rec. Clause-clause subsumption calls : 828837
% 246.20/31.58 # Non-unit clause-clause subsumptions : 41610
% 246.20/31.58 # Unit Clause-clause subsumption calls : 5589
% 246.20/31.58 # Rewrite failures with RHS unbound : 0
% 246.20/31.58 # BW rewrite match attempts : 11
% 246.20/31.58 # BW rewrite match successes : 8
% 246.20/31.58 # Condensation attempts : 0
% 246.20/31.58 # Condensation successes : 0
% 246.20/31.58 # Termbank termtop insertions : 29232640
% 246.20/31.58
% 246.20/31.58 # -------------------------------------------------
% 246.20/31.58 # User time : 30.010 s
% 246.20/31.58 # System time : 0.753 s
% 246.20/31.58 # Total time : 30.763 s
% 246.20/31.58 # Maximum resident set size: 1780 pages
% 246.20/31.58
% 246.20/31.58 # -------------------------------------------------
% 246.20/31.58 # User time : 152.080 s
% 246.20/31.58 # System time : 1.748 s
% 246.20/31.58 # Total time : 153.828 s
% 246.20/31.58 # Maximum resident set size: 1688 pages
% 246.20/31.58 % E---3.1 exiting
% 246.20/31.58 % E---3.1 exiting
%------------------------------------------------------------------------------