TSTP Solution File: SYN965+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SYN965+1 : TPTP v8.1.0. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n025.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:58:30 EDT 2022
% Result : Theorem 7.66s 2.26s
% Output : CNFRefutation 7.66s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 4
% Syntax : Number of clauses : 12 ( 4 unt; 2 nHn; 3 RR)
% Number of literals : 20 ( 0 equ; 8 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 1 ( 1 usr; 0 con; 1-1 aty)
% Number of variables : 28 ( 18 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_6,negated_conjecture,
( p(X1,X2)
| p(X2,esk1_1(X1)) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-63dqxc66/input.p',i_0_6) ).
cnf(i_0_2,negated_conjecture,
( p(X1,X2)
| ~ p(X3,X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-63dqxc66/input.p',i_0_2) ).
cnf(i_0_3,negated_conjecture,
( p(X1,X2)
| ~ p(X3,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-63dqxc66/input.p',i_0_3) ).
cnf(i_0_1,negated_conjecture,
( ~ p(X1,X2)
| ~ p(X2,esk1_1(X3)) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-63dqxc66/input.p',i_0_1) ).
cnf(c_0_11,negated_conjecture,
( p(X1,X2)
| p(X2,esk1_1(X1)) ),
i_0_6 ).
cnf(c_0_12,negated_conjecture,
( p(X1,X2)
| ~ p(X3,X1) ),
i_0_2 ).
cnf(c_0_13,negated_conjecture,
p(X1,esk1_1(X2)),
inference(csr,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_14,negated_conjecture,
( p(X1,X2)
| ~ p(X3,X2) ),
i_0_3 ).
cnf(c_0_15,negated_conjecture,
p(esk1_1(X1),X2),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_16,negated_conjecture,
( ~ p(X1,X2)
| ~ p(X2,esk1_1(X3)) ),
i_0_1 ).
cnf(c_0_17,negated_conjecture,
p(X1,X2),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_18,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_16,c_0_17]),c_0_17])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : SYN965+1 : TPTP v8.1.0. Released v3.1.0.
% 0.06/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n025.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 : Mon Jul 11 18:29:34 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.18/0.44 # ENIGMATIC: Selected complete mode:
% 7.66/2.26 # ENIGMATIC: Solved by autoschedule:
% 7.66/2.26 # No SInE strategy applied
% 7.66/2.26 # Trying AutoSched0 for 150 seconds
% 7.66/2.26 # AutoSched0-Mode selected heuristic G_____0003_C18_F1_SE_CS_SP_S0Y
% 7.66/2.26 # and selection function SelectMaxLComplexAvoidPosPred.
% 7.66/2.26 #
% 7.66/2.26 # Preprocessing time : 0.022 s
% 7.66/2.26
% 7.66/2.26 # Proof found!
% 7.66/2.26 # SZS status Theorem
% 7.66/2.26 # SZS output start CNFRefutation
% See solution above
% 7.66/2.26 # Training examples: 0 positive, 0 negative
% 7.66/2.26
% 7.66/2.26 # -------------------------------------------------
% 7.66/2.26 # User time : 0.020 s
% 7.66/2.26 # System time : 0.006 s
% 7.66/2.26 # Total time : 0.027 s
% 7.66/2.26 # Maximum resident set size: 7120 pages
% 7.66/2.26
%------------------------------------------------------------------------------