TSTP Solution File: SYN412+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SYN412+1 : TPTP v8.1.0. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n021.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 : Thu Jul 21 04:52:07 EDT 2022
% Result : Theorem 7.97s 2.25s
% Output : CNFRefutation 7.97s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 2
% Syntax : Number of clauses : 7 ( 3 unt; 2 nHn; 5 RR)
% Number of literals : 11 ( 0 equ; 5 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 1 ( 1 usr; 1 con; 0-0 aty)
% Number of variables : 5 ( 5 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_1,negated_conjecture,
( f(esk1_0,X1)
| f(esk1_0,esk1_0) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-3biqg16e/input.p',i_0_1) ).
cnf(i_0_2,negated_conjecture,
( ~ f(esk1_0,X1)
| ~ f(esk1_0,esk1_0) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-3biqg16e/input.p',i_0_2) ).
cnf(c_0_5,negated_conjecture,
( f(esk1_0,X1)
| f(esk1_0,esk1_0) ),
i_0_1 ).
cnf(c_0_6,negated_conjecture,
( ~ f(esk1_0,X1)
| ~ f(esk1_0,esk1_0) ),
i_0_2 ).
cnf(c_0_7,negated_conjecture,
f(esk1_0,esk1_0),
inference(ef,[status(thm)],[c_0_5]) ).
cnf(c_0_8,negated_conjecture,
~ f(esk1_0,X1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_6,c_0_7])]) ).
cnf(c_0_9,negated_conjecture,
$false,
inference(sr,[status(thm)],[c_0_7,c_0_8]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SYN412+1 : TPTP v8.1.0. Released v2.0.0.
% 0.07/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.13/0.34 % Computer : n021.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Mon Jul 11 13:07:40 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.19/0.45 # ENIGMATIC: Selected complete mode:
% 7.97/2.25 # ENIGMATIC: Solved by autoschedule:
% 7.97/2.25 # No SInE strategy applied
% 7.97/2.25 # Trying AutoSched0 for 150 seconds
% 7.97/2.25 # AutoSched0-Mode selected heuristic G_E___200_B07_F1_AE_CS_SP_PI_S0Y
% 7.97/2.25 # and selection function SelectMaxLComplexAvoidPosPred.
% 7.97/2.25 #
% 7.97/2.25 # Preprocessing time : 0.023 s
% 7.97/2.25
% 7.97/2.25 # Proof found!
% 7.97/2.25 # SZS status Theorem
% 7.97/2.25 # SZS output start CNFRefutation
% See solution above
% 7.97/2.25 # Training examples: 0 positive, 0 negative
% 7.97/2.25
% 7.97/2.25 # -------------------------------------------------
% 7.97/2.25 # User time : 0.021 s
% 7.97/2.25 # System time : 0.008 s
% 7.97/2.25 # Total time : 0.029 s
% 7.97/2.25 # Maximum resident set size: 7124 pages
% 7.97/2.25
%------------------------------------------------------------------------------