TSTP Solution File: NUM427+3 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : NUM427+3 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n007.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 : Mon Jul 18 08:35:53 EDT 2022
% Result : Theorem 7.29s 2.36s
% Output : CNFRefutation 7.29s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 4
% Syntax : Number of clauses : 11 ( 6 unt; 0 nHn; 11 RR)
% Number of literals : 16 ( 5 equ; 9 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 3 ( 2 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 4 con; 0-2 aty)
% Number of variables : 5 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_45,negated_conjecture,
( sdtasdt0(xq,X1) != sdtpldt0(xb,smndt0(xa))
| ~ aInteger0(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-g0f2liwd/input.p',i_0_45) ).
cnf(i_0_42,hypothesis,
sdtpldt0(xb,smndt0(xa)) = sdtasdt0(xq,smndt0(xn)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-g0f2liwd/input.p',i_0_42) ).
cnf(i_0_4,plain,
( aInteger0(smndt0(X1))
| ~ aInteger0(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-g0f2liwd/input.p',i_0_4) ).
cnf(i_0_41,hypothesis,
aInteger0(xn),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-g0f2liwd/input.p',i_0_41) ).
cnf(c_0_50,negated_conjecture,
( sdtasdt0(xq,X1) != sdtpldt0(xb,smndt0(xa))
| ~ aInteger0(X1) ),
i_0_45 ).
cnf(c_0_51,hypothesis,
sdtpldt0(xb,smndt0(xa)) = sdtasdt0(xq,smndt0(xn)),
i_0_42 ).
cnf(c_0_52,negated_conjecture,
( sdtasdt0(xq,X1) != sdtasdt0(xq,smndt0(xn))
| ~ aInteger0(X1) ),
inference(rw,[status(thm)],[c_0_50,c_0_51]) ).
cnf(c_0_53,negated_conjecture,
~ aInteger0(smndt0(xn)),
inference(er,[status(thm)],[c_0_52]) ).
cnf(c_0_54,plain,
( aInteger0(smndt0(X1))
| ~ aInteger0(X1) ),
i_0_4 ).
cnf(c_0_55,hypothesis,
aInteger0(xn),
i_0_41 ).
cnf(c_0_56,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_54]),c_0_55])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : NUM427+3 : TPTP v8.1.0. Released v4.0.0.
% 0.03/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.34 % Computer : n007.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 Jul 7 12:02:16 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.19/0.45 # ENIGMATIC: Selected complete mode:
% 7.29/2.36 # ENIGMATIC: Solved by autoschedule:
% 7.29/2.36 # No SInE strategy applied
% 7.29/2.36 # Trying AutoSched0 for 150 seconds
% 7.29/2.36 # AutoSched0-Mode selected heuristic G_E___207_C18_F1_SE_CS_SP_PI_PS_S2S
% 7.29/2.36 # and selection function SelectNewComplexAHP.
% 7.29/2.36 #
% 7.29/2.36 # Preprocessing time : 0.012 s
% 7.29/2.36 # Presaturation interreduction done
% 7.29/2.36
% 7.29/2.36 # Proof found!
% 7.29/2.36 # SZS status Theorem
% 7.29/2.36 # SZS output start CNFRefutation
% See solution above
% 7.29/2.36 # Training examples: 0 positive, 0 negative
% 7.29/2.36
% 7.29/2.36 # -------------------------------------------------
% 7.29/2.36 # User time : 0.016 s
% 7.29/2.36 # System time : 0.004 s
% 7.29/2.36 # Total time : 0.020 s
% 7.29/2.36 # Maximum resident set size: 7124 pages
% 7.29/2.36
%------------------------------------------------------------------------------