TSTP Solution File: SYN325+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SYN325+1 : TPTP v8.1.0. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n022.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:51:15 EDT 2022
% Result : Theorem 8.92s 2.43s
% Output : CNFRefutation 8.92s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 3
% Syntax : Number of clauses : 9 ( 5 unt; 2 nHn; 5 RR)
% Number of literals : 13 ( 0 equ; 4 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 1 ( 1 usr; 0 con; 1-1 aty)
% Number of variables : 8 ( 3 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_1,negated_conjecture,
~ big_g(esk1_1(X1)),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-oimeu5jk/input.p',i_0_1) ).
cnf(i_0_4,negated_conjecture,
( big_g(X1)
| big_f(X1,X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-oimeu5jk/input.p',i_0_4) ).
cnf(i_0_2,negated_conjecture,
( big_g(X1)
| ~ big_f(esk1_1(X1),esk1_1(X1)) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-oimeu5jk/input.p',i_0_2) ).
cnf(c_0_8,negated_conjecture,
~ big_g(esk1_1(X1)),
i_0_1 ).
cnf(c_0_9,negated_conjecture,
( big_g(X1)
| big_f(X1,X1) ),
i_0_4 ).
cnf(c_0_10,negated_conjecture,
( big_g(X1)
| ~ big_f(esk1_1(X1),esk1_1(X1)) ),
i_0_2 ).
cnf(c_0_11,negated_conjecture,
big_f(esk1_1(X1),esk1_1(X1)),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_12,negated_conjecture,
big_g(X1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_10,c_0_11])]) ).
cnf(c_0_13,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_8,c_0_12])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SYN325+1 : TPTP v8.1.0. Released v2.0.0.
% 0.03/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.34 % Computer : n022.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 : Mon Jul 11 18:18:12 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.19/0.45 # ENIGMATIC: Selected complete mode:
% 8.92/2.43 # ENIGMATIC: Solved by autoschedule:
% 8.92/2.43 # No SInE strategy applied
% 8.92/2.43 # Trying AutoSched0 for 150 seconds
% 8.92/2.43 # AutoSched0-Mode selected heuristic G_N___023_B07_F1_SP_PI_Q7_CS_SE_S0Y
% 8.92/2.43 # and selection function SelectMaxLComplexAvoidPosPred.
% 8.92/2.43 #
% 8.92/2.43 # Preprocessing time : 0.018 s
% 8.92/2.43
% 8.92/2.43 # Proof found!
% 8.92/2.43 # SZS status Theorem
% 8.92/2.43 # SZS output start CNFRefutation
% See solution above
% 8.92/2.43 # Training examples: 0 positive, 0 negative
% 8.92/2.43
% 8.92/2.43 # -------------------------------------------------
% 8.92/2.43 # User time : 0.019 s
% 8.92/2.43 # System time : 0.006 s
% 8.92/2.43 # Total time : 0.025 s
% 8.92/2.43 # Maximum resident set size: 7120 pages
% 8.92/2.43
%------------------------------------------------------------------------------