TSTP Solution File: SYN365+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SYN365+1 : TPTP v8.1.0. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n013.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:43 EDT 2022
% Result : Theorem 7.18s 2.24s
% Output : CNFRefutation 7.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 6
% Syntax : Number of clauses : 16 ( 6 unt; 0 nHn; 16 RR)
% Number of literals : 26 ( 0 equ; 15 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 1 con; 0-1 aty)
% Number of variables : 10 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_1,negated_conjecture,
( ~ big_p(X1)
| ~ big_r(esk2_0,X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ie2xmtam/input.p',i_0_1) ).
cnf(i_0_6,negated_conjecture,
( big_r(X1,g(h(esk1_1(X1))))
| ~ big_p(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ie2xmtam/input.p',i_0_6) ).
cnf(i_0_2,negated_conjecture,
big_p(esk2_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ie2xmtam/input.p',i_0_2) ).
cnf(i_0_4,negated_conjecture,
( big_p(g(X1))
| ~ big_p(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ie2xmtam/input.p',i_0_4) ).
cnf(i_0_3,negated_conjecture,
( big_p(h(X1))
| ~ big_p(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ie2xmtam/input.p',i_0_3) ).
cnf(i_0_5,negated_conjecture,
( big_p(esk1_1(X1))
| ~ big_p(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ie2xmtam/input.p',i_0_5) ).
cnf(c_0_13,negated_conjecture,
( ~ big_p(X1)
| ~ big_r(esk2_0,X1) ),
i_0_1 ).
cnf(c_0_14,negated_conjecture,
( big_r(X1,g(h(esk1_1(X1))))
| ~ big_p(X1) ),
i_0_6 ).
cnf(c_0_15,negated_conjecture,
big_p(esk2_0),
i_0_2 ).
cnf(c_0_16,negated_conjecture,
~ big_p(g(h(esk1_1(esk2_0)))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_15])]) ).
cnf(c_0_17,negated_conjecture,
( big_p(g(X1))
| ~ big_p(X1) ),
i_0_4 ).
cnf(c_0_18,negated_conjecture,
~ big_p(h(esk1_1(esk2_0))),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_19,negated_conjecture,
( big_p(h(X1))
| ~ big_p(X1) ),
i_0_3 ).
cnf(c_0_20,negated_conjecture,
~ big_p(esk1_1(esk2_0)),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_21,negated_conjecture,
( big_p(esk1_1(X1))
| ~ big_p(X1) ),
i_0_5 ).
cnf(c_0_22,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_15])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SYN365+1 : TPTP v8.1.0. Released v2.0.0.
% 0.07/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.13/0.34 % Computer : n013.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Mon Jul 11 17:00:47 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.19/0.45 # ENIGMATIC: Selected complete mode:
% 7.18/2.24 # ENIGMATIC: Solved by autoschedule:
% 7.18/2.24 # No SInE strategy applied
% 7.18/2.24 # Trying AutoSched0 for 150 seconds
% 7.18/2.24 # AutoSched0-Mode selected heuristic G_____0026_C18_F1_SE_CS_SP_S4S
% 7.18/2.24 # and selection function SelectNewComplexAHPNS.
% 7.18/2.24 #
% 7.18/2.24 # Preprocessing time : 0.023 s
% 7.18/2.24
% 7.18/2.24 # Proof found!
% 7.18/2.24 # SZS status Theorem
% 7.18/2.24 # SZS output start CNFRefutation
% See solution above
% 7.18/2.24 # Training examples: 0 positive, 0 negative
% 7.18/2.24
% 7.18/2.24 # -------------------------------------------------
% 7.18/2.24 # User time : 0.022 s
% 7.18/2.24 # System time : 0.007 s
% 7.18/2.24 # Total time : 0.028 s
% 7.18/2.24 # Maximum resident set size: 7120 pages
% 7.18/2.24
%------------------------------------------------------------------------------