TSTP Solution File: SYN386+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SYN386+1 : TPTP v8.1.0. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n015.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:53 EDT 2022
% Result : Theorem 7.33s 2.28s
% Output : CNFRefutation 7.33s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 6
% Syntax : Number of clauses : 17 ( 11 unt; 0 nHn; 10 RR)
% Number of literals : 28 ( 0 equ; 16 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 7 ( 7 usr; 1 con; 0-2 aty)
% Number of variables : 38 ( 9 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_1,negated_conjecture,
~ big_d(esk7_2(X1,X2),X1,esk5_1(X1)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-8_3cy8kh/input.p',i_0_1) ).
cnf(i_0_4,negated_conjecture,
( big_d(X1,X2,X3)
| ~ big_f(X4,X2)
| ~ big_f(X5,X1)
| ~ big_d(X5,X4,esk4_1(X3)) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-8_3cy8kh/input.p',i_0_4) ).
cnf(i_0_5,negated_conjecture,
( big_d(X1,esk2_0,X2)
| ~ big_s(esk3_1(X2),X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-8_3cy8kh/input.p',i_0_5) ).
cnf(i_0_3,negated_conjecture,
big_s(X1,esk6_2(X2,X1)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-8_3cy8kh/input.p',i_0_3) ).
cnf(i_0_2,negated_conjecture,
big_f(esk6_2(X1,X2),esk7_2(X1,X2)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-8_3cy8kh/input.p',i_0_2) ).
cnf(i_0_6,negated_conjecture,
big_f(X1,esk1_1(X1)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-8_3cy8kh/input.p',i_0_6) ).
cnf(c_0_13,negated_conjecture,
~ big_d(esk7_2(X1,X2),X1,esk5_1(X1)),
i_0_1 ).
cnf(c_0_14,negated_conjecture,
( big_d(X1,X2,X3)
| ~ big_f(X4,X2)
| ~ big_f(X5,X1)
| ~ big_d(X5,X4,esk4_1(X3)) ),
i_0_4 ).
cnf(c_0_15,negated_conjecture,
( big_d(X1,esk2_0,X2)
| ~ big_s(esk3_1(X2),X1) ),
i_0_5 ).
cnf(c_0_16,negated_conjecture,
big_s(X1,esk6_2(X2,X1)),
i_0_3 ).
cnf(c_0_17,negated_conjecture,
( ~ big_d(X1,X2,esk4_1(esk5_1(X3)))
| ~ big_f(X1,esk7_2(X3,X4))
| ~ big_f(X2,X3) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_18,negated_conjecture,
big_d(esk6_2(X1,esk3_1(X2)),esk2_0,X2),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_19,negated_conjecture,
( ~ big_f(esk6_2(X1,esk3_1(esk4_1(esk5_1(X2)))),esk7_2(X2,X3))
| ~ big_f(esk2_0,X2) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_20,negated_conjecture,
big_f(esk6_2(X1,X2),esk7_2(X1,X2)),
i_0_2 ).
cnf(c_0_21,negated_conjecture,
~ big_f(esk2_0,X1),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_22,negated_conjecture,
big_f(X1,esk1_1(X1)),
i_0_6 ).
cnf(c_0_23,negated_conjecture,
$false,
inference(spm,[status(thm)],[c_0_21,c_0_22]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SYN386+1 : TPTP v8.1.0. Released v2.0.0.
% 0.03/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n015.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 13:26:26 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.19/0.45 # ENIGMATIC: Selected complete mode:
% 7.33/2.28 # ENIGMATIC: Solved by autoschedule:
% 7.33/2.28 # No SInE strategy applied
% 7.33/2.28 # Trying AutoSched0 for 150 seconds
% 7.33/2.28 # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S024I
% 7.33/2.28 # and selection function SelectOptimalRestrPDepth2.
% 7.33/2.28 #
% 7.33/2.28 # Preprocessing time : 0.023 s
% 7.33/2.28 # Presaturation interreduction done
% 7.33/2.28
% 7.33/2.28 # Proof found!
% 7.33/2.28 # SZS status Theorem
% 7.33/2.28 # SZS output start CNFRefutation
% See solution above
% 7.33/2.28 # Training examples: 0 positive, 0 negative
% 7.33/2.28
% 7.33/2.28 # -------------------------------------------------
% 7.33/2.28 # User time : 0.023 s
% 7.33/2.28 # System time : 0.006 s
% 7.33/2.28 # Total time : 0.029 s
% 7.33/2.28 # Maximum resident set size: 7124 pages
% 7.33/2.28
%------------------------------------------------------------------------------