TSTP Solution File: SYN068+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SYN068+1 : TPTP v8.1.0. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n014.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:49:30 EDT 2022
% Result : Theorem 8.40s 2.44s
% Output : CNFRefutation 8.40s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 5
% Syntax : Number of clauses : 13 ( 5 unt; 0 nHn; 13 RR)
% Number of literals : 21 ( 0 equ; 11 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 5 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 2 ( 2 usr; 1 con; 0-1 aty)
% Number of variables : 8 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_7,negated_conjecture,
( big_f(X1)
| ~ big_j(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-kfjeo5gc/input.p',i_0_7) ).
cnf(i_0_6,plain,
big_j(esk3_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-kfjeo5gc/input.p',i_0_6) ).
cnf(i_0_1,plain,
( ~ big_f(X1)
| ~ big_h(X1,esk2_1(X1)) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-kfjeo5gc/input.p',i_0_1) ).
cnf(i_0_5,plain,
( big_h(esk3_0,X1)
| ~ big_g(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-kfjeo5gc/input.p',i_0_5) ).
cnf(i_0_2,plain,
( big_g(esk2_1(X1))
| ~ big_f(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-kfjeo5gc/input.p',i_0_2) ).
cnf(c_0_13,negated_conjecture,
( big_f(X1)
| ~ big_j(X1) ),
i_0_7 ).
cnf(c_0_14,plain,
big_j(esk3_0),
i_0_6 ).
cnf(c_0_15,plain,
( ~ big_f(X1)
| ~ big_h(X1,esk2_1(X1)) ),
i_0_1 ).
cnf(c_0_16,plain,
( big_h(esk3_0,X1)
| ~ big_g(X1) ),
i_0_5 ).
cnf(c_0_17,negated_conjecture,
big_f(esk3_0),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_18,plain,
~ big_g(esk2_1(esk3_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_17])]) ).
cnf(c_0_19,plain,
( big_g(esk2_1(X1))
| ~ big_f(X1) ),
i_0_2 ).
cnf(c_0_20,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_17])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.10 % Problem : SYN068+1 : TPTP v8.1.0. Released v2.0.0.
% 0.00/0.11 % Command : enigmatic-eprover.py %s %d 1
% 0.11/0.32 % Computer : n014.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 300
% 0.11/0.32 % WCLimit : 600
% 0.11/0.32 % DateTime : Tue Jul 12 00:31:20 EDT 2022
% 0.11/0.32 % CPUTime :
% 0.17/0.43 # ENIGMATIC: Selected complete mode:
% 8.40/2.44 # ENIGMATIC: Solved by autoschedule:
% 8.40/2.44 # No SInE strategy applied
% 8.40/2.44 # Trying AutoSched0 for 150 seconds
% 8.40/2.44 # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S0Y_ni
% 8.40/2.44 # and selection function SelectMaxLComplexAvoidPosPred.
% 8.40/2.44 #
% 8.40/2.44 # Preprocessing time : 0.019 s
% 8.40/2.44 # Presaturation interreduction done
% 8.40/2.44
% 8.40/2.44 # Proof found!
% 8.40/2.44 # SZS status Theorem
% 8.40/2.44 # SZS output start CNFRefutation
% See solution above
% 8.40/2.44 # Training examples: 0 positive, 0 negative
% 8.40/2.44
% 8.40/2.44 # -------------------------------------------------
% 8.40/2.44 # User time : 0.023 s
% 8.40/2.44 # System time : 0.003 s
% 8.40/2.44 # Total time : 0.026 s
% 8.40/2.44 # Maximum resident set size: 7120 pages
% 8.40/2.44
%------------------------------------------------------------------------------