TSTP Solution File: SYN364+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SYN364+1 : TPTP v8.1.0. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n011.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:42 EDT 2022
% Result : Theorem 8.39s 2.49s
% Output : CNFRefutation 8.39s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 5
% Syntax : Number of clauses : 16 ( 5 unt; 5 nHn; 7 RR)
% Number of literals : 27 ( 0 equ; 12 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 1 con; 0-2 aty)
% Number of variables : 20 ( 10 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_1,negated_conjecture,
( ~ big_p(esk3_0,esk3_0)
| ~ big_p(g(esk3_0),X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-5qnzhd_m/input.p',i_0_1) ).
cnf(i_0_5,negated_conjecture,
( big_p(X1,X1)
| ~ big_p(X2,X3) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-5qnzhd_m/input.p',i_0_5) ).
cnf(i_0_4,negated_conjecture,
( big_m(X1)
| big_p(X1,esk1_1(X1)) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-5qnzhd_m/input.p',i_0_4) ).
cnf(i_0_2,negated_conjecture,
( ~ big_q(X1)
| ~ big_m(g(X1)) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-5qnzhd_m/input.p',i_0_2) ).
cnf(i_0_3,negated_conjecture,
( big_p(X1,esk1_1(X1))
| big_q(f(X1,esk2_1(X1))) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-5qnzhd_m/input.p',i_0_3) ).
cnf(c_0_11,negated_conjecture,
( ~ big_p(esk3_0,esk3_0)
| ~ big_p(g(esk3_0),X1) ),
i_0_1 ).
cnf(c_0_12,negated_conjecture,
( big_p(X1,X1)
| ~ big_p(X2,X3) ),
i_0_5 ).
cnf(c_0_13,negated_conjecture,
( big_m(X1)
| big_p(X1,esk1_1(X1)) ),
i_0_4 ).
cnf(c_0_14,negated_conjecture,
~ big_p(g(esk3_0),X1),
inference(csr,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_15,negated_conjecture,
( big_p(X1,X1)
| big_m(X2) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_16,negated_conjecture,
( ~ big_q(X1)
| ~ big_m(g(X1)) ),
i_0_2 ).
cnf(c_0_17,negated_conjecture,
big_m(X1),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_18,negated_conjecture,
( big_p(X1,esk1_1(X1))
| big_q(f(X1,esk2_1(X1))) ),
i_0_3 ).
cnf(c_0_19,negated_conjecture,
~ big_q(X1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_16,c_0_17])]) ).
cnf(c_0_20,negated_conjecture,
big_p(X1,esk1_1(X1)),
inference(sr,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_21,negated_conjecture,
$false,
inference(spm,[status(thm)],[c_0_14,c_0_20]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SYN364+1 : TPTP v8.1.0. Released v2.0.0.
% 0.11/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n011.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 : Tue Jul 12 06:45:59 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.18/0.44 # ENIGMATIC: Selected complete mode:
% 8.39/2.49 # ENIGMATIC: Solved by autoschedule:
% 8.39/2.49 # No SInE strategy applied
% 8.39/2.49 # Trying AutoSched0 for 150 seconds
% 8.39/2.49 # AutoSched0-Mode selected heuristic G_E___092_C01_F1_AE_CS_SP_PS_CO_S0Y
% 8.39/2.49 # and selection function SelectMaxLComplexAvoidPosPred.
% 8.39/2.49 #
% 8.39/2.49 # Preprocessing time : 0.022 s
% 8.39/2.49 # Presaturation interreduction done
% 8.39/2.49
% 8.39/2.49 # Proof found!
% 8.39/2.49 # SZS status Theorem
% 8.39/2.49 # SZS output start CNFRefutation
% See solution above
% 8.39/2.49 # Training examples: 0 positive, 0 negative
% 8.39/2.49
% 8.39/2.49 # -------------------------------------------------
% 8.39/2.49 # User time : 0.023 s
% 8.39/2.49 # System time : 0.004 s
% 8.39/2.49 # Total time : 0.027 s
% 8.39/2.49 # Maximum resident set size: 7116 pages
% 8.39/2.49
%------------------------------------------------------------------------------