TSTP Solution File: SWV486+1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : SWV486+1 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n026.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:59:52 EDT 2023
% Result : Theorem 0.14s 0.56s
% Output : CNFRefutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 12
% Syntax : Number of formulae : 84 ( 21 unt; 0 def)
% Number of atoms : 251 ( 56 equ)
% Maximal formula atoms : 14 ( 2 avg)
% Number of connectives : 268 ( 101 ~; 106 |; 37 &)
% ( 4 <=>; 20 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 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; 6 con; 0-2 aty)
% Number of variables : 157 ( 0 sgn; 73 !; 1 ?)
% Comments :
%------------------------------------------------------------------------------
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.ZM6GcWtqV0/E---3.1_11150.p',plus_and_inverse) ).
fof(int_less_irreflexive,axiom,
! [X1,X2] :
( int_less(X1,X2)
=> X1 != X2 ),
file('/export/starexec/sandbox2/tmp/tmp.ZM6GcWtqV0/E---3.1_11150.p',int_less_irreflexive) ).
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.ZM6GcWtqV0/E---3.1_11150.p',int_less_transitive) ).
fof(plus_commutative,axiom,
! [X1,X2] : plus(X1,X2) = plus(X2,X1),
file('/export/starexec/sandbox2/tmp/tmp.ZM6GcWtqV0/E---3.1_11150.p',plus_commutative) ).
fof(int_leq,axiom,
! [X1,X2] :
( int_leq(X1,X2)
<=> ( int_less(X1,X2)
| X1 = X2 ) ),
file('/export/starexec/sandbox2/tmp/tmp.ZM6GcWtqV0/E---3.1_11150.p',int_leq) ).
fof(one_successor_of_zero,axiom,
! [X1] :
( int_less(int_zero,X1)
<=> int_leq(int_one,X1) ),
file('/export/starexec/sandbox2/tmp/tmp.ZM6GcWtqV0/E---3.1_11150.p',one_successor_of_zero) ).
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.ZM6GcWtqV0/E---3.1_11150.p',plus_and_order1) ).
fof(int_less_total,axiom,
! [X1,X2] :
( int_less(X1,X2)
| int_leq(X2,X1) ),
file('/export/starexec/sandbox2/tmp/tmp.ZM6GcWtqV0/E---3.1_11150.p',int_less_total) ).
fof(plus_zero,axiom,
! [X1] : plus(X1,int_zero) = X1,
file('/export/starexec/sandbox2/tmp/tmp.ZM6GcWtqV0/E---3.1_11150.p',plus_zero) ).
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.ZM6GcWtqV0/E---3.1_11150.p',lt) ).
fof(qih,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) = qr(plus(X3,X8),X3) ) )
& ! [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.ZM6GcWtqV0/E---3.1_11150.p',qih) ).
fof(c_0_11,plain,
! [X27,X28,X30,X31,X32] :
( ( plus(X27,esk3_2(X27,X28)) = X28
| ~ int_less(X27,X28) )
& ( int_less(int_zero,esk3_2(X27,X28))
| ~ int_less(X27,X28) )
& ( plus(X30,X32) != X31
| ~ int_less(int_zero,X32)
| int_less(X30,X31) ) ),
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])])])])])]) ).
fof(c_0_12,plain,
! [X25,X26] :
( ~ int_less(X25,X26)
| X25 != X26 ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[int_less_irreflexive])]) ).
fof(c_0_13,plain,
! [X22,X23,X24] :
( ~ int_less(X22,X23)
| ~ int_less(X23,X24)
| int_less(X22,X24) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[int_less_transitive])]) ).
cnf(c_0_14,plain,
( int_less(X1,X3)
| plus(X1,X2) != X3
| ~ int_less(int_zero,X2) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_15,plain,
( ~ int_less(X1,X2)
| X1 != X2 ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_16,plain,
( int_less(X1,X3)
| ~ int_less(X1,X2)
| ~ int_less(X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_17,plain,
( int_less(X1,plus(X1,X2))
| ~ int_less(int_zero,X2) ),
inference(er,[status(thm)],[c_0_14]) ).
fof(c_0_18,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) = qr(plus(X3,X8),X3) ) )
& ! [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) ).
cnf(c_0_19,plain,
~ int_less(X1,X1),
inference(er,[status(thm)],[c_0_15]) ).
cnf(c_0_20,plain,
( int_less(X1,plus(X2,X3))
| ~ int_less(int_zero,X3)
| ~ int_less(X1,X2) ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
fof(c_0_21,plain,
! [X33,X34] : plus(X33,X34) = plus(X34,X33),
inference(variable_rename,[status(thm)],[plus_commutative]) ).
fof(c_0_22,plain,
! [X13,X14] :
( ( ~ int_leq(X13,X14)
| int_less(X13,X14)
| X13 = X14 )
& ( ~ int_less(X13,X14)
| int_leq(X13,X14) )
& ( X13 != X14
| int_leq(X13,X14) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[int_leq])])]) ).
fof(c_0_23,plain,
! [X21] :
( ( ~ int_less(int_zero,X21)
| int_leq(int_one,X21) )
& ( ~ int_leq(int_one,X21)
| int_less(int_zero,X21) ) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[one_successor_of_zero])]) ).
fof(c_0_24,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) = qr(plus(X3,X8),X3) ) )
& ! [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_18]) ).
fof(c_0_25,plain,
! [X17,X18,X19,X20] :
( ~ int_less(X17,X18)
| ~ int_leq(X19,X20)
| int_leq(plus(X17,X19),plus(X18,X20)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[plus_and_order1])]) ).
cnf(c_0_26,plain,
( ~ int_less(plus(X1,X2),X1)
| ~ int_less(int_zero,X2) ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_27,plain,
plus(X1,X2) = plus(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_28,plain,
( int_less(X1,X2)
| X1 = X2
| ~ int_leq(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_29,plain,
( int_leq(int_one,X1)
| ~ int_less(int_zero,X1) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
fof(c_0_30,plain,
! [X36,X37,X38,X39,X40,X41] :
( ( ~ int_less(int_zero,X38)
| X37 != plus(X36,X38)
| ~ int_leq(int_one,X39)
| ~ int_leq(X39,X36)
| a(plus(X39,X38),X39) = qr(plus(X39,X38),X39)
| ~ epred1_2(X37,X36) )
& ( ~ int_less(int_zero,X40)
| X36 != plus(X37,X40)
| ~ int_leq(int_one,X41)
| ~ int_leq(X41,X37)
| a(X41,plus(X41,X40)) = 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_24])])])]) ).
cnf(c_0_31,plain,
( int_leq(plus(X1,X3),plus(X2,X4))
| ~ int_less(X1,X2)
| ~ int_leq(X3,X4) ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_32,plain,
( plus(X1,esk3_2(X1,X2)) = X2
| ~ int_less(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
fof(c_0_33,plain,
! [X15,X16] :
( int_less(X15,X16)
| int_leq(X16,X15) ),
inference(variable_rename,[status(thm)],[int_less_total]) ).
fof(c_0_34,plain,
! [X35] : plus(X35,int_zero) = X35,
inference(variable_rename,[status(thm)],[plus_zero]) ).
cnf(c_0_35,plain,
( ~ int_less(plus(X1,X2),X2)
| ~ int_less(int_zero,X1) ),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_36,plain,
( int_one = X1
| int_less(int_one,X1)
| ~ int_less(int_zero,X1) ),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_37,plain,
( int_less(int_zero,esk3_2(X1,X2))
| ~ int_less(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
fof(c_0_38,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]) ).
cnf(c_0_39,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_30]) ).
cnf(c_0_40,plain,
( int_leq(plus(X1,X2),X3)
| ~ int_less(X1,X4)
| ~ int_less(X4,X3)
| ~ int_leq(X2,esk3_2(X4,X3)) ),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_41,plain,
( int_less(int_zero,X1)
| ~ int_leq(int_one,X1) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_42,plain,
( int_less(X1,X2)
| int_leq(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_33]) ).
cnf(c_0_43,plain,
plus(X1,int_zero) = X1,
inference(split_conjunct,[status(thm)],[c_0_34]) ).
cnf(c_0_44,plain,
( int_less(X1,plus(X2,X1))
| ~ int_less(int_zero,X2) ),
inference(spm,[status(thm)],[c_0_17,c_0_27]) ).
cnf(c_0_45,plain,
( ~ int_less(X1,esk3_2(X2,X1))
| ~ int_less(int_zero,X2)
| ~ int_less(X2,X1) ),
inference(spm,[status(thm)],[c_0_35,c_0_32]) ).
cnf(c_0_46,plain,
( esk3_2(X1,X2) = int_one
| int_less(int_one,esk3_2(X1,X2))
| ~ int_less(X1,X2) ),
inference(spm,[status(thm)],[c_0_36,c_0_37]) ).
fof(c_0_47,negated_conjecture,
( int_leq(int_one,esk1_0)
& int_less(esk1_0,esk2_0)
& int_leq(esk2_0,n)
& a(esk1_0,esk2_0) != real_zero ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_38])])]) ).
cnf(c_0_48,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_39]) ).
cnf(c_0_49,plain,
( int_leq(X1,X2)
| X1 != X2 ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_50,plain,
( int_leq(plus(X1,int_one),X2)
| ~ int_less(X1,X3)
| ~ int_less(X3,X2) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_29]),c_0_37]) ).
cnf(c_0_51,plain,
( int_less(X1,int_one)
| int_less(int_zero,X1) ),
inference(spm,[status(thm)],[c_0_41,c_0_42]) ).
cnf(c_0_52,plain,
plus(int_zero,X1) = X1,
inference(spm,[status(thm)],[c_0_43,c_0_27]) ).
cnf(c_0_53,plain,
( int_less(esk3_2(X1,X2),X2)
| ~ int_less(int_zero,X1)
| ~ int_less(X1,X2) ),
inference(spm,[status(thm)],[c_0_44,c_0_32]) ).
cnf(c_0_54,plain,
( esk3_2(X1,int_one) = int_one
| ~ int_less(int_zero,X1)
| ~ int_less(X1,int_one) ),
inference(spm,[status(thm)],[c_0_45,c_0_46]) ).
cnf(c_0_55,negated_conjecture,
int_leq(int_one,esk1_0),
inference(split_conjunct,[status(thm)],[c_0_47]) ).
cnf(c_0_56,negated_conjecture,
int_leq(esk2_0,n),
inference(split_conjunct,[status(thm)],[c_0_47]) ).
cnf(c_0_57,plain,
( a(X1,plus(X1,esk3_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_48,c_0_32]),c_0_37]) ).
cnf(c_0_58,plain,
int_leq(X1,X1),
inference(er,[status(thm)],[c_0_49]) ).
fof(c_0_59,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)],[qih,c_0_18]) ).
cnf(c_0_60,plain,
( int_less(X1,int_one)
| int_leq(int_one,X2)
| ~ int_less(X1,X2) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_51]),c_0_52]) ).
cnf(c_0_61,negated_conjecture,
int_less(esk1_0,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_47]) ).
cnf(c_0_62,plain,
( ~ int_less(int_zero,X1)
| ~ int_less(X1,int_one) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_54]),c_0_19]) ).
cnf(c_0_63,negated_conjecture,
int_less(int_zero,esk1_0),
inference(spm,[status(thm)],[c_0_41,c_0_55]) ).
cnf(c_0_64,negated_conjecture,
( n = esk2_0
| int_less(esk2_0,n) ),
inference(spm,[status(thm)],[c_0_28,c_0_56]) ).
cnf(c_0_65,plain,
( X1 = X2
| int_less(X2,X1)
| int_less(X1,X2) ),
inference(spm,[status(thm)],[c_0_28,c_0_42]) ).
cnf(c_0_66,negated_conjecture,
a(esk1_0,esk2_0) != real_zero,
inference(split_conjunct,[status(thm)],[c_0_47]) ).
cnf(c_0_67,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_57,c_0_32]),c_0_58])]) ).
fof(c_0_68,hypothesis,
! [X11,X12] :
( ~ int_leq(int_one,X11)
| ~ int_leq(X11,n)
| ~ int_leq(int_one,X12)
| ~ int_leq(X12,n)
| epred1_2(X11,X12) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_59])]) ).
cnf(c_0_69,negated_conjecture,
( int_less(esk1_0,int_one)
| int_leq(int_one,esk2_0) ),
inference(spm,[status(thm)],[c_0_60,c_0_61]) ).
cnf(c_0_70,negated_conjecture,
~ int_less(esk1_0,int_one),
inference(spm,[status(thm)],[c_0_62,c_0_63]) ).
cnf(c_0_71,negated_conjecture,
( n = esk2_0
| int_less(X1,n)
| ~ int_less(X1,esk2_0) ),
inference(spm,[status(thm)],[c_0_16,c_0_64]) ).
cnf(c_0_72,plain,
( X1 = X2
| int_less(X2,X1)
| int_less(X3,X2)
| ~ int_less(X3,X1) ),
inference(spm,[status(thm)],[c_0_16,c_0_65]) ).
cnf(c_0_73,negated_conjecture,
~ epred1_2(esk1_0,esk2_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_66,c_0_67]),c_0_61]),c_0_55])]) ).
cnf(c_0_74,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_68]) ).
cnf(c_0_75,negated_conjecture,
int_leq(int_one,esk2_0),
inference(sr,[status(thm)],[c_0_69,c_0_70]) ).
cnf(c_0_76,negated_conjecture,
( n = esk2_0
| ~ int_less(n,esk2_0) ),
inference(spm,[status(thm)],[c_0_19,c_0_71]) ).
cnf(c_0_77,negated_conjecture,
( esk2_0 = X1
| int_less(esk1_0,X1)
| int_less(X1,esk2_0) ),
inference(spm,[status(thm)],[c_0_72,c_0_61]) ).
cnf(c_0_78,hypothesis,
~ int_leq(esk1_0,n),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_73,c_0_74]),c_0_56]),c_0_75]),c_0_55])]) ).
cnf(c_0_79,plain,
( int_leq(X1,X2)
| ~ int_less(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_80,negated_conjecture,
( n = esk2_0
| int_less(esk1_0,n) ),
inference(spm,[status(thm)],[c_0_76,c_0_77]) ).
cnf(c_0_81,hypothesis,
~ int_less(esk1_0,n),
inference(spm,[status(thm)],[c_0_78,c_0_79]) ).
cnf(c_0_82,negated_conjecture,
n = esk2_0,
inference(sr,[status(thm)],[c_0_80,c_0_81]) ).
cnf(c_0_83,hypothesis,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_81,c_0_82]),c_0_61])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.09 % Problem : SWV486+1 : TPTP v8.1.2. Released v4.0.0.
% 0.00/0.10 % Command : run_E %s %d THM
% 0.10/0.30 % Computer : n026.cluster.edu
% 0.10/0.30 % Model : x86_64 x86_64
% 0.10/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.30 % Memory : 8042.1875MB
% 0.10/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.30 % CPULimit : 2400
% 0.14/0.30 % WCLimit : 300
% 0.14/0.30 % DateTime : Tue Oct 3 03:35:59 EDT 2023
% 0.14/0.30 % CPUTime :
% 0.14/0.40 Running first-order model finding
% 0.14/0.40 Running: /export/starexec/sandbox2/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/sandbox2/tmp/tmp.ZM6GcWtqV0/E---3.1_11150.p
% 0.14/0.56 # Version: 3.1pre001
% 0.14/0.56 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.14/0.56 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.56 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.14/0.56 # Starting new_bool_3 with 300s (1) cores
% 0.14/0.56 # Starting new_bool_1 with 300s (1) cores
% 0.14/0.56 # Starting sh5l with 300s (1) cores
% 0.14/0.56 # sh5l with pid 11230 completed with status 0
% 0.14/0.56 # Result found by sh5l
% 0.14/0.56 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.14/0.56 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.56 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.14/0.56 # Starting new_bool_3 with 300s (1) cores
% 0.14/0.56 # Starting new_bool_1 with 300s (1) cores
% 0.14/0.56 # Starting sh5l with 300s (1) cores
% 0.14/0.56 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.14/0.56 # Search class: FGHSS-FFSS22-SFFFFFNN
% 0.14/0.56 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.14/0.56 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.14/0.56 # SAT001_MinMin_p005000_rr_RG with pid 11238 completed with status 0
% 0.14/0.56 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.14/0.56 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.14/0.56 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.56 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.14/0.56 # Starting new_bool_3 with 300s (1) cores
% 0.14/0.56 # Starting new_bool_1 with 300s (1) cores
% 0.14/0.56 # Starting sh5l with 300s (1) cores
% 0.14/0.56 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.14/0.56 # Search class: FGHSS-FFSS22-SFFFFFNN
% 0.14/0.56 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.14/0.56 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.14/0.56 # Preprocessing time : 0.001 s
% 0.14/0.56 # Presaturation interreduction done
% 0.14/0.56
% 0.14/0.56 # Proof found!
% 0.14/0.56 # SZS status Theorem
% 0.14/0.56 # SZS output start CNFRefutation
% See solution above
% 0.14/0.56 # Parsed axioms : 13
% 0.14/0.56 # Removed by relevancy pruning/SinE : 0
% 0.14/0.56 # Initial clauses : 23
% 0.14/0.56 # Removed in clause preprocessing : 0
% 0.14/0.56 # Initial clauses in saturation : 23
% 0.14/0.56 # Processed clauses : 2640
% 0.14/0.56 # ...of these trivial : 9
% 0.14/0.56 # ...subsumed : 2145
% 0.14/0.56 # ...remaining for further processing : 486
% 0.14/0.56 # Other redundant clauses eliminated : 5
% 0.14/0.56 # Clauses deleted for lack of memory : 0
% 0.14/0.56 # Backward-subsumed : 74
% 0.14/0.56 # Backward-rewritten : 69
% 0.14/0.56 # Generated clauses : 7556
% 0.14/0.56 # ...of the previous two non-redundant : 7021
% 0.14/0.56 # ...aggressively subsumed : 0
% 0.14/0.56 # Contextual simplify-reflections : 9
% 0.14/0.56 # Paramodulations : 7545
% 0.14/0.56 # Factorizations : 2
% 0.14/0.56 # NegExts : 0
% 0.14/0.56 # Equation resolutions : 5
% 0.14/0.56 # Total rewrite steps : 817
% 0.14/0.56 # Propositional unsat checks : 0
% 0.14/0.56 # Propositional check models : 0
% 0.14/0.56 # Propositional check unsatisfiable : 0
% 0.14/0.56 # Propositional clauses : 0
% 0.14/0.56 # Propositional clauses after purity: 0
% 0.14/0.56 # Propositional unsat core size : 0
% 0.14/0.56 # Propositional preprocessing time : 0.000
% 0.14/0.56 # Propositional encoding time : 0.000
% 0.14/0.56 # Propositional solver time : 0.000
% 0.14/0.56 # Success case prop preproc time : 0.000
% 0.14/0.56 # Success case prop encoding time : 0.000
% 0.14/0.56 # Success case prop solver time : 0.000
% 0.14/0.56 # Current number of processed clauses : 311
% 0.14/0.56 # Positive orientable unit clauses : 10
% 0.14/0.56 # Positive unorientable unit clauses: 1
% 0.14/0.56 # Negative unit clauses : 10
% 0.14/0.56 # Non-unit-clauses : 290
% 0.14/0.56 # Current number of unprocessed clauses: 4302
% 0.14/0.56 # ...number of literals in the above : 20876
% 0.14/0.56 # Current number of archived formulas : 0
% 0.14/0.56 # Current number of archived clauses : 170
% 0.14/0.56 # Clause-clause subsumption calls (NU) : 36467
% 0.14/0.56 # Rec. Clause-clause subsumption calls : 16626
% 0.14/0.56 # Non-unit clause-clause subsumptions : 1510
% 0.14/0.56 # Unit Clause-clause subsumption calls : 615
% 0.14/0.56 # Rewrite failures with RHS unbound : 0
% 0.14/0.56 # BW rewrite match attempts : 10
% 0.14/0.56 # BW rewrite match successes : 7
% 0.14/0.56 # Condensation attempts : 0
% 0.14/0.56 # Condensation successes : 0
% 0.14/0.56 # Termbank termtop insertions : 93428
% 0.14/0.56
% 0.14/0.56 # -------------------------------------------------
% 0.14/0.56 # User time : 0.144 s
% 0.14/0.56 # System time : 0.008 s
% 0.14/0.56 # Total time : 0.152 s
% 0.14/0.56 # Maximum resident set size: 1728 pages
% 0.14/0.56
% 0.14/0.56 # -------------------------------------------------
% 0.14/0.56 # User time : 0.145 s
% 0.14/0.56 # System time : 0.009 s
% 0.14/0.56 # Total time : 0.155 s
% 0.14/0.56 # Maximum resident set size: 1688 pages
% 0.14/0.56 % E---3.1 exiting
%------------------------------------------------------------------------------