TSTP Solution File: SYN065+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SYN065+1 : TPTP v8.1.0. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n003.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:27 EDT 2022
% Result : Theorem 4.47s 2.25s
% Output : CNFRefutation 4.47s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 3
% Syntax : Number of clauses : 9 ( 6 unt; 0 nHn; 6 RR)
% Number of literals : 14 ( 0 equ; 7 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 3 ( 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 : 13 ( 2 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_3,plain,
( big_h(X1,X2)
| ~ big_g(X1,X3)
| ~ big_g(X3,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-9nmirm2w/lgb.p',i_0_3) ).
cnf(i_0_2,plain,
big_g(X1,esk2_1(X1)),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-9nmirm2w/lgb.p',i_0_2) ).
cnf(i_0_7,negated_conjecture,
~ big_h(esk3_0,X1),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-9nmirm2w/lgb.p',i_0_7) ).
cnf(c_0_11,plain,
( big_h(X1,X2)
| ~ big_g(X1,X3)
| ~ big_g(X3,X2) ),
i_0_3 ).
cnf(c_0_12,plain,
big_g(X1,esk2_1(X1)),
i_0_2 ).
cnf(c_0_13,plain,
( big_h(X1,X2)
| ~ big_g(esk2_1(X1),X2) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_14,negated_conjecture,
~ big_h(esk3_0,X1),
i_0_7 ).
cnf(c_0_15,plain,
big_h(X1,esk2_1(esk2_1(X1))),
inference(spm,[status(thm)],[c_0_13,c_0_12]) ).
cnf(c_0_16,negated_conjecture,
$false,
inference(spm,[status(thm)],[c_0_14,c_0_15]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : SYN065+1 : TPTP v8.1.0. Released v2.0.0.
% 0.10/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.13/0.33 % Computer : n003.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 600
% 0.13/0.33 % DateTime : Tue Jul 12 09:06:02 EDT 2022
% 0.13/0.33 % CPUTime :
% 0.19/0.45 # ENIGMATIC: Selected complete mode:
% 4.47/2.25 # ENIGMATIC: Solved by autoschedule-lgb:
% 4.47/2.25 # No SInE strategy applied
% 4.47/2.25 # Trying AutoSched0 for 150 seconds
% 4.47/2.25 # AutoSched0-Mode selected heuristic G_E___207_C18_F1_AE_CS_SP_PI_S0a
% 4.47/2.25 # and selection function SelectNegativeLiterals.
% 4.47/2.25 #
% 4.47/2.25 # Preprocessing time : 0.012 s
% 4.47/2.25
% 4.47/2.25 # Proof found!
% 4.47/2.25 # SZS status Theorem
% 4.47/2.25 # SZS output start CNFRefutation
% See solution above
% 4.47/2.25 # Training examples: 0 positive, 0 negative
% 4.47/2.25
% 4.47/2.25 # -------------------------------------------------
% 4.47/2.25 # User time : 0.011 s
% 4.47/2.25 # System time : 0.005 s
% 4.47/2.25 # Total time : 0.015 s
% 4.47/2.25 # Maximum resident set size: 7120 pages
% 4.47/2.25
%------------------------------------------------------------------------------