TSTP Solution File: SYN936+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SYN936+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:09 EDT 2022
% Result : Theorem 6.72s 2.24s
% Output : CNFRefutation 6.72s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 3
% Syntax : Number of clauses : 9 ( 4 unt; 3 nHn; 5 RR)
% Number of literals : 16 ( 0 equ; 6 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 2 prp; 0-1 aty)
% Number of functors : 2 ( 2 usr; 2 con; 0-0 aty)
% Number of variables : 7 ( 7 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_1,negated_conjecture,
( p(X1)
| p(X2)
| ~ c ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-f_5u6esz/input.p',i_0_1) ).
cnf(i_0_5,negated_conjecture,
c,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-f_5u6esz/input.p',i_0_5) ).
cnf(i_0_2,negated_conjecture,
( ~ p(esk1_0)
| ~ p(esk2_0) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-f_5u6esz/input.p',i_0_2) ).
cnf(c_0_9,negated_conjecture,
( p(X1)
| p(X2)
| ~ c ),
i_0_1 ).
cnf(c_0_10,negated_conjecture,
c,
i_0_5 ).
cnf(c_0_11,negated_conjecture,
( ~ p(esk1_0)
| ~ p(esk2_0) ),
i_0_2 ).
cnf(c_0_12,negated_conjecture,
( p(X1)
| p(X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_9,c_0_10])]) ).
cnf(c_0_13,negated_conjecture,
p(X1),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_12]),c_0_12]) ).
cnf(c_0_14,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_11,c_0_13]),c_0_13])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SYN936+1 : TPTP v8.1.0. Released v3.1.0.
% 0.03/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 23:01:49 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.18/0.44 # ENIGMATIC: Selected complete mode:
% 6.72/2.24 # ENIGMATIC: Solved by autoschedule:
% 6.72/2.24 # No SInE strategy applied
% 6.72/2.24 # Trying AutoSched0 for 150 seconds
% 6.72/2.24 # AutoSched0-Mode selected heuristic G_E___200_B07_F1_AE_CS_SP_PI_S0Y
% 6.72/2.24 # and selection function SelectMaxLComplexAvoidPosPred.
% 6.72/2.24 #
% 6.72/2.24 # Preprocessing time : 0.012 s
% 6.72/2.24
% 6.72/2.24 # Proof found!
% 6.72/2.24 # SZS status Theorem
% 6.72/2.24 # SZS output start CNFRefutation
% See solution above
% 6.72/2.24 # Training examples: 0 positive, 0 negative
% 6.72/2.24
% 6.72/2.24 # -------------------------------------------------
% 6.72/2.24 # User time : 0.014 s
% 6.72/2.24 # System time : 0.001 s
% 6.72/2.24 # Total time : 0.015 s
% 6.72/2.24 # Maximum resident set size: 7120 pages
% 6.72/2.24
%------------------------------------------------------------------------------