TSTP Solution File: SWV488+3 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SWV488+3 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% 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 : 300s
% WCLimit : 600s
% DateTime : Wed Jul 20 17:47:46 EDT 2022
% Result : Theorem 8.39s 2.45s
% Output : CNFRefutation 8.39s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 8
% Syntax : Number of clauses : 23 ( 14 unt; 0 nHn; 22 RR)
% Number of literals : 45 ( 11 equ; 27 neg)
% Maximal clause size : 5 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 6 con; 0-2 aty)
% Number of variables : 20 ( 3 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_18,negated_conjecture,
a(esk2_0,esk3_0) = real_zero,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-i57odll4/lgb.p',i_0_18) ).
cnf(i_0_19,negated_conjecture,
esk3_0 = esk2_0,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-i57odll4/lgb.p',i_0_19) ).
cnf(i_0_24,plain,
( a(X1,X1) = real_one
| ~ int_leq(X1,X2)
| ~ epred1_2(X3,X2)
| ~ int_leq(int_one,X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-i57odll4/lgb.p',i_0_24) ).
cnf(i_0_22,negated_conjecture,
int_leq(int_one,esk3_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-i57odll4/lgb.p',i_0_22) ).
cnf(i_0_16,plain,
real_one != real_zero,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-i57odll4/lgb.p',i_0_16) ).
cnf(i_0_17,hypothesis,
( epred1_2(X1,X2)
| ~ int_leq(X2,n)
| ~ int_leq(X1,n)
| ~ int_leq(int_one,X2)
| ~ int_leq(int_one,X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-i57odll4/lgb.p',i_0_17) ).
cnf(i_0_1,plain,
( int_leq(X1,X2)
| X1 != X2 ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-i57odll4/lgb.p',i_0_1) ).
cnf(i_0_20,negated_conjecture,
int_leq(esk2_0,n),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-i57odll4/lgb.p',i_0_20) ).
cnf(c_0_33,negated_conjecture,
a(esk2_0,esk3_0) = real_zero,
i_0_18 ).
cnf(c_0_34,negated_conjecture,
esk3_0 = esk2_0,
i_0_19 ).
cnf(c_0_35,plain,
( a(X1,X1) = real_one
| ~ int_leq(X1,X2)
| ~ epred1_2(X3,X2)
| ~ int_leq(int_one,X1) ),
i_0_24 ).
cnf(c_0_36,negated_conjecture,
int_leq(int_one,esk3_0),
i_0_22 ).
cnf(c_0_37,negated_conjecture,
a(esk3_0,esk3_0) = real_zero,
inference(rw,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_38,plain,
real_one != real_zero,
i_0_16 ).
cnf(c_0_39,negated_conjecture,
( ~ epred1_2(X1,X2)
| ~ int_leq(esk3_0,X2) ),
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),c_0_37]),c_0_38]) ).
cnf(c_0_40,hypothesis,
( epred1_2(X1,X2)
| ~ int_leq(X2,n)
| ~ int_leq(X1,n)
| ~ int_leq(int_one,X2)
| ~ int_leq(int_one,X1) ),
i_0_17 ).
cnf(c_0_41,plain,
( int_leq(X1,X2)
| X1 != X2 ),
i_0_1 ).
cnf(c_0_42,negated_conjecture,
int_leq(esk2_0,n),
i_0_20 ).
cnf(c_0_43,hypothesis,
( ~ int_leq(esk3_0,X1)
| ~ int_leq(X1,n)
| ~ int_leq(X2,n)
| ~ int_leq(int_one,X1)
| ~ int_leq(int_one,X2) ),
inference(spm,[status(thm)],[c_0_39,c_0_40]) ).
cnf(c_0_44,plain,
int_leq(X1,X1),
inference(er,[status(thm)],[c_0_41]) ).
cnf(c_0_45,negated_conjecture,
int_leq(esk3_0,n),
inference(rw,[status(thm)],[c_0_42,c_0_34]) ).
cnf(c_0_46,plain,
( ~ int_leq(X1,n)
| ~ int_leq(int_one,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_44]),c_0_45]),c_0_36])]) ).
cnf(c_0_47,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_45]),c_0_36])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : SWV488+3 : TPTP v8.1.0. Released v4.0.0.
% 0.12/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.34 % Computer : n018.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Thu Jun 16 00:38:17 EDT 2022
% 0.12/0.35 % CPUTime :
% 0.19/0.45 # ENIGMATIC: Selected complete mode:
% 8.39/2.45 # ENIGMATIC: Solved by autoschedule-lgb:
% 8.39/2.45 # No SInE strategy applied
% 8.39/2.45 # Trying AutoSched0 for 150 seconds
% 8.39/2.45 # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 8.39/2.45 # and selection function SelectComplexExceptUniqMaxHorn.
% 8.39/2.45 #
% 8.39/2.45 # Preprocessing time : 0.023 s
% 8.39/2.45 # Presaturation interreduction done
% 8.39/2.45
% 8.39/2.45 # Proof found!
% 8.39/2.45 # SZS status Theorem
% 8.39/2.45 # SZS output start CNFRefutation
% See solution above
% 8.39/2.45 # Training examples: 0 positive, 0 negative
% 8.39/2.45
% 8.39/2.45 # -------------------------------------------------
% 8.39/2.45 # User time : 0.026 s
% 8.39/2.45 # System time : 0.007 s
% 8.39/2.45 # Total time : 0.033 s
% 8.39/2.45 # Maximum resident set size: 7128 pages
% 8.39/2.45
%------------------------------------------------------------------------------