TSTP Solution File: NUM514+3 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : NUM514+3 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n020.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:36:51 EDT 2022
% Result : Theorem 7.95s 2.50s
% Output : CNFRefutation 7.95s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 3
% Syntax : Number of clauses : 8 ( 5 unt; 0 nHn; 8 RR)
% Number of literals : 11 ( 5 equ; 6 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 5 con; 0-2 aty)
% Number of variables : 3 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_277,negated_conjecture,
( sdtasdt0(sdtsldt0(xn,xr),xm) != sdtasdt0(xp,X1)
| ~ aNaturalNumber0(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-n4vgdz8j/lgb.p',i_0_277) ).
cnf(i_0_271,hypothesis,
sdtasdt0(sdtsldt0(xn,xr),xm) = sdtasdt0(xp,sdtsldt0(xk,xr)),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-n4vgdz8j/lgb.p',i_0_271) ).
cnf(i_0_275,hypothesis,
aNaturalNumber0(sdtsldt0(xk,xr)),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-n4vgdz8j/lgb.p',i_0_275) ).
cnf(c_0_281,negated_conjecture,
( sdtasdt0(sdtsldt0(xn,xr),xm) != sdtasdt0(xp,X1)
| ~ aNaturalNumber0(X1) ),
i_0_277 ).
cnf(c_0_282,hypothesis,
sdtasdt0(sdtsldt0(xn,xr),xm) = sdtasdt0(xp,sdtsldt0(xk,xr)),
i_0_271 ).
cnf(c_0_283,negated_conjecture,
( sdtasdt0(xp,sdtsldt0(xk,xr)) != sdtasdt0(xp,X1)
| ~ aNaturalNumber0(X1) ),
inference(rw,[status(thm)],[c_0_281,c_0_282]) ).
cnf(c_0_284,hypothesis,
aNaturalNumber0(sdtsldt0(xk,xr)),
i_0_275 ).
cnf(c_0_285,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[c_0_283]),c_0_284])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.13/0.13 % Problem : NUM514+3 : TPTP v8.1.0. Released v4.0.0.
% 0.13/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.13/0.35 % Computer : n020.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 : 600
% 0.13/0.35 % DateTime : Thu Jul 7 13:00:00 EDT 2022
% 0.20/0.35 % CPUTime :
% 0.20/0.46 # ENIGMATIC: Selected complete mode:
% 7.95/2.50 # ENIGMATIC: Solved by autoschedule-lgb:
% 7.95/2.50 # No SInE strategy applied
% 7.95/2.50 # Trying AutoSched0 for 150 seconds
% 7.95/2.50 # AutoSched0-Mode selected heuristic G_E___207_C01_F1_SE_CS_SP_PI_S0Y
% 7.95/2.50 # and selection function SelectMaxLComplexAvoidPosPred.
% 7.95/2.50 #
% 7.95/2.50 # Preprocessing time : 0.029 s
% 7.95/2.50
% 7.95/2.50 # Proof found!
% 7.95/2.50 # SZS status Theorem
% 7.95/2.50 # SZS output start CNFRefutation
% See solution above
% 7.95/2.50 # Training examples: 0 positive, 0 negative
% 7.95/2.50
% 7.95/2.50 # -------------------------------------------------
% 7.95/2.50 # User time : 0.026 s
% 7.95/2.50 # System time : 0.013 s
% 7.95/2.50 # Total time : 0.039 s
% 7.95/2.50 # Maximum resident set size: 7124 pages
% 7.95/2.50
%------------------------------------------------------------------------------