TSTP Solution File: NUM434+3 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : NUM434+3 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n023.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:58 EDT 2022
% Result : Theorem 7.22s 2.24s
% Output : CNFRefutation 7.22s
% 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 ( 2 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 5 con; 0-2 aty)
% Number of variables : 3 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_45,negated_conjecture,
( sdtasdt0(sdtasdt0(xp,xq),X1) != sdtpldt0(xa,smndt0(xb))
| ~ aInteger0(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-n5lsw792/input.p',i_0_45) ).
cnf(i_0_42,hypothesis,
sdtasdt0(sdtasdt0(xp,xq),esk2_0) = sdtpldt0(xa,smndt0(xb)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-n5lsw792/input.p',i_0_42) ).
cnf(i_0_43,hypothesis,
aInteger0(esk2_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-n5lsw792/input.p',i_0_43) ).
cnf(c_0_49,negated_conjecture,
( sdtasdt0(sdtasdt0(xp,xq),X1) != sdtpldt0(xa,smndt0(xb))
| ~ aInteger0(X1) ),
i_0_45 ).
cnf(c_0_50,hypothesis,
sdtasdt0(sdtasdt0(xp,xq),esk2_0) = sdtpldt0(xa,smndt0(xb)),
i_0_42 ).
cnf(c_0_51,negated_conjecture,
( sdtasdt0(sdtasdt0(xp,xq),X1) != sdtasdt0(sdtasdt0(xp,xq),esk2_0)
| ~ aInteger0(X1) ),
inference(rw,[status(thm)],[c_0_49,c_0_50]) ).
cnf(c_0_52,hypothesis,
aInteger0(esk2_0),
i_0_43 ).
cnf(c_0_53,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[c_0_51]),c_0_52])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.11 % Problem : NUM434+3 : TPTP v8.1.0. Released v4.0.0.
% 0.07/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n023.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Tue Jul 5 21:04:29 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.18/0.44 # ENIGMATIC: Selected complete mode:
% 7.22/2.24 # ENIGMATIC: Solved by autoschedule:
% 7.22/2.24 # No SInE strategy applied
% 7.22/2.24 # Trying AutoSched0 for 150 seconds
% 7.22/2.24 # AutoSched0-Mode selected heuristic G_E___207_C18_F1_SE_CS_SP_PI_PS_S2S
% 7.22/2.24 # and selection function SelectNewComplexAHP.
% 7.22/2.24 #
% 7.22/2.24 # Preprocessing time : 0.012 s
% 7.22/2.24 # Presaturation interreduction done
% 7.22/2.24
% 7.22/2.24 # Proof found!
% 7.22/2.24 # SZS status Theorem
% 7.22/2.24 # SZS output start CNFRefutation
% See solution above
% 7.22/2.24 # Training examples: 0 positive, 0 negative
% 7.22/2.24
% 7.22/2.24 # -------------------------------------------------
% 7.22/2.24 # User time : 0.015 s
% 7.22/2.24 # System time : 0.004 s
% 7.22/2.24 # Total time : 0.019 s
% 7.22/2.24 # Maximum resident set size: 7120 pages
% 7.22/2.24
%------------------------------------------------------------------------------