TSTP Solution File: SYN967+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SYN967+1 : TPTP v8.1.0. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n027.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:31 EDT 2022
% Result : Theorem 7.59s 2.36s
% Output : CNFRefutation 7.59s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 3
% Syntax : Number of clauses : 8 ( 2 unt; 2 nHn; 5 RR)
% Number of literals : 14 ( 0 equ; 6 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-1 aty)
% Number of functors : 2 ( 2 usr; 2 con; 0-0 aty)
% Number of variables : 5 ( 1 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_4,negated_conjecture,
( q(X1)
| p(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-_a6kcbkg/input.p',i_0_4) ).
cnf(i_0_5,negated_conjecture,
( p(X1)
| ~ q(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-_a6kcbkg/input.p',i_0_5) ).
cnf(i_0_1,negated_conjecture,
( ~ p(esk1_0)
| ~ p(esk2_0) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-_a6kcbkg/input.p',i_0_1) ).
cnf(c_0_9,negated_conjecture,
( q(X1)
| p(X1) ),
i_0_4 ).
cnf(c_0_10,negated_conjecture,
( p(X1)
| ~ q(X1) ),
i_0_5 ).
cnf(c_0_11,negated_conjecture,
( ~ p(esk1_0)
| ~ p(esk2_0) ),
i_0_1 ).
cnf(c_0_12,negated_conjecture,
p(X1),
inference(csr,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_13,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_11,c_0_12]),c_0_12])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : SYN967+1 : TPTP v8.1.0. Released v3.1.0.
% 0.06/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.13/0.33 % Computer : n027.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 600
% 0.13/0.33 % DateTime : Tue Jul 12 09:23:22 EDT 2022
% 0.13/0.33 % CPUTime :
% 0.19/0.44 # ENIGMATIC: Selected complete mode:
% 7.59/2.36 # ENIGMATIC: Solved by autoschedule:
% 7.59/2.36 # No SInE strategy applied
% 7.59/2.36 # Trying AutoSched0 for 150 seconds
% 7.59/2.36 # AutoSched0-Mode selected heuristic G_E___200_B07_F1_AE_CS_SP_PI_S0Y
% 7.59/2.36 # and selection function SelectMaxLComplexAvoidPosPred.
% 7.59/2.36 #
% 7.59/2.36 # Preprocessing time : 0.022 s
% 7.59/2.36
% 7.59/2.36 # Proof found!
% 7.59/2.36 # SZS status Theorem
% 7.59/2.36 # SZS output start CNFRefutation
% See solution above
% 7.59/2.36 # Training examples: 0 positive, 0 negative
% 7.59/2.36
% 7.59/2.36 # -------------------------------------------------
% 7.59/2.36 # User time : 0.021 s
% 7.59/2.36 # System time : 0.005 s
% 7.59/2.36 # Total time : 0.026 s
% 7.59/2.36 # Maximum resident set size: 7124 pages
% 7.59/2.36
%------------------------------------------------------------------------------