TSTP Solution File: SYN359+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SYN359+1 : TPTP v8.1.0. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n024.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:39 EDT 2022
% Result : Theorem 7.66s 2.32s
% Output : CNFRefutation 7.66s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 4
% Syntax : Number of clauses : 10 ( 4 unt; 0 nHn; 10 RR)
% Number of literals : 16 ( 0 equ; 9 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 : 2 ( 2 usr; 1 con; 0-1 aty)
% Number of variables : 11 ( 5 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_2,negated_conjecture,
( big_q(X1,X1)
| ~ big_q(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-5pz2mxkj/input.p',i_0_2) ).
cnf(i_0_3,negated_conjecture,
( big_q(X1,esk2_1(X1))
| ~ big_r(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-5pz2mxkj/input.p',i_0_3) ).
cnf(i_0_1,negated_conjecture,
( ~ big_r(X1)
| ~ big_q(X2,X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-5pz2mxkj/input.p',i_0_1) ).
cnf(i_0_4,negated_conjecture,
big_r(esk1_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-5pz2mxkj/input.p',i_0_4) ).
cnf(c_0_9,negated_conjecture,
( big_q(X1,X1)
| ~ big_q(X1,X2) ),
i_0_2 ).
cnf(c_0_10,negated_conjecture,
( big_q(X1,esk2_1(X1))
| ~ big_r(X1) ),
i_0_3 ).
cnf(c_0_11,negated_conjecture,
( ~ big_r(X1)
| ~ big_q(X2,X1) ),
i_0_1 ).
cnf(c_0_12,negated_conjecture,
big_r(esk1_0),
i_0_4 ).
cnf(c_0_13,negated_conjecture,
~ big_r(X1),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_10]),c_0_11]) ).
cnf(c_0_14,negated_conjecture,
$false,
inference(sr,[status(thm)],[c_0_12,c_0_13]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : SYN359+1 : TPTP v8.1.0. Released v2.0.0.
% 0.06/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n024.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 15:21:00 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.18/0.44 # ENIGMATIC: Selected complete mode:
% 7.66/2.32 # ENIGMATIC: Solved by autoschedule:
% 7.66/2.32 # No SInE strategy applied
% 7.66/2.32 # Trying AutoSched0 for 150 seconds
% 7.66/2.32 # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S0Y_ni
% 7.66/2.32 # and selection function SelectMaxLComplexAvoidPosPred.
% 7.66/2.32 #
% 7.66/2.32 # Preprocessing time : 0.023 s
% 7.66/2.32 # Presaturation interreduction done
% 7.66/2.32
% 7.66/2.32 # Proof found!
% 7.66/2.32 # SZS status Theorem
% 7.66/2.32 # SZS output start CNFRefutation
% See solution above
% 7.66/2.32 # Training examples: 0 positive, 0 negative
% 7.66/2.32
% 7.66/2.32 # -------------------------------------------------
% 7.66/2.32 # User time : 0.022 s
% 7.66/2.32 # System time : 0.007 s
% 7.66/2.32 # Total time : 0.029 s
% 7.66/2.32 # Maximum resident set size: 7120 pages
% 7.66/2.32
%------------------------------------------------------------------------------