TSTP Solution File: SYN326+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SYN326+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:51:15 EDT 2022
% Result : Theorem 6.67s 2.12s
% Output : CNFRefutation 6.67s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 4
% Syntax : Number of clauses : 11 ( 5 unt; 2 nHn; 8 RR)
% Number of literals : 17 ( 0 equ; 7 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 2 ( 2 usr; 0 con; 1-1 aty)
% Number of variables : 10 ( 1 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_5,negated_conjecture,
( big_f(X1,X1)
| ~ big_h(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-r9oye1wn/lgb.p',i_0_5) ).
cnf(i_0_3,negated_conjecture,
( big_h(esk2_1(X1))
| ~ big_g(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-r9oye1wn/lgb.p',i_0_3) ).
cnf(i_0_1,negated_conjecture,
~ big_f(esk2_1(X1),esk2_1(X1)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-r9oye1wn/lgb.p',i_0_1) ).
cnf(i_0_6,negated_conjecture,
( big_f(X1,X1)
| big_g(esk1_1(X1)) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-r9oye1wn/lgb.p',i_0_6) ).
cnf(c_0_11,negated_conjecture,
( big_f(X1,X1)
| ~ big_h(X1) ),
i_0_5 ).
cnf(c_0_12,negated_conjecture,
( big_h(esk2_1(X1))
| ~ big_g(X1) ),
i_0_3 ).
cnf(c_0_13,negated_conjecture,
~ big_f(esk2_1(X1),esk2_1(X1)),
i_0_1 ).
cnf(c_0_14,negated_conjecture,
( big_f(X1,X1)
| big_g(esk1_1(X1)) ),
i_0_6 ).
cnf(c_0_15,negated_conjecture,
~ big_g(X1),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_12]),c_0_13]) ).
cnf(c_0_16,negated_conjecture,
big_f(X1,X1),
inference(sr,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_17,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_13,c_0_16])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.11 % Problem : SYN326+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 : n003.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 08:49:17 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.19/0.43 # ENIGMATIC: Selected complete mode:
% 6.67/2.12 # ENIGMATIC: Solved by autoschedule-lgb:
% 6.67/2.12 # No SInE strategy applied
% 6.67/2.12 # Trying AutoSched0 for 150 seconds
% 6.67/2.12 # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 6.67/2.12 # and selection function SelectComplexExceptUniqMaxHorn.
% 6.67/2.12 #
% 6.67/2.12 # Preprocessing time : 0.012 s
% 6.67/2.12 # Presaturation interreduction done
% 6.67/2.12
% 6.67/2.12 # Proof found!
% 6.67/2.12 # SZS status Theorem
% 6.67/2.12 # SZS output start CNFRefutation
% See solution above
% 6.67/2.12 # Training examples: 0 positive, 0 negative
% 6.67/2.12
% 6.67/2.12 # -------------------------------------------------
% 6.67/2.12 # User time : 0.012 s
% 6.67/2.12 # System time : 0.005 s
% 6.67/2.12 # Total time : 0.017 s
% 6.67/2.12 # Maximum resident set size: 7124 pages
% 6.67/2.12
%------------------------------------------------------------------------------