TSTP Solution File: SYN352+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SYN352+1 : TPTP v8.1.0. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n006.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:35 EDT 2022
% Result : Theorem 7.57s 2.32s
% Output : CNFRefutation 7.57s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 3
% Syntax : Number of clauses : 9 ( 2 unt; 5 nHn; 5 RR)
% Number of literals : 20 ( 0 equ; 8 neg)
% Maximal clause size : 3 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 1 ( 1 usr; 0 con; 2-2 aty)
% Number of variables : 16 ( 2 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_1,negated_conjecture,
( big_f(X1,esk3_2(X2,X1))
| big_f(X2,esk3_2(X2,X1))
| ~ big_f(X2,X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-cdx37ibn/input.p',i_0_1) ).
cnf(i_0_5,negated_conjecture,
( big_f(X1,X2)
| big_f(esk3_2(X1,X2),esk3_2(X1,X2)) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-cdx37ibn/input.p',i_0_5) ).
cnf(i_0_2,negated_conjecture,
( ~ big_f(X1,X2)
| ~ big_f(X2,esk3_2(X1,X2))
| ~ big_f(X1,esk3_2(X1,X2)) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-cdx37ibn/input.p',i_0_2) ).
cnf(c_0_9,negated_conjecture,
( big_f(X1,esk3_2(X2,X1))
| big_f(X2,esk3_2(X2,X1))
| ~ big_f(X2,X1) ),
i_0_1 ).
cnf(c_0_10,negated_conjecture,
( big_f(X1,X2)
| big_f(esk3_2(X1,X2),esk3_2(X1,X2)) ),
i_0_5 ).
cnf(c_0_11,negated_conjecture,
( ~ big_f(X1,X2)
| ~ big_f(X2,esk3_2(X1,X2))
| ~ big_f(X1,esk3_2(X1,X2)) ),
i_0_2 ).
cnf(c_0_12,negated_conjecture,
( big_f(esk3_2(X1,X2),esk3_2(esk3_2(X1,X2),esk3_2(X1,X2)))
| big_f(X1,X2) ),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_13,negated_conjecture,
big_f(X1,X2),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_12]),c_0_10]),c_0_12]) ).
cnf(c_0_14,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_11,c_0_13]),c_0_13]),c_0_13])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SYN352+1 : TPTP v8.1.0. Released v2.0.0.
% 0.12/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.13/0.33 % Computer : n006.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 : Mon Jul 11 16:45:07 EDT 2022
% 0.19/0.33 % CPUTime :
% 0.19/0.44 # ENIGMATIC: Selected complete mode:
% 7.57/2.32 # ENIGMATIC: Solved by autoschedule:
% 7.57/2.32 # No SInE strategy applied
% 7.57/2.32 # Trying AutoSched0 for 150 seconds
% 7.57/2.32 # AutoSched0-Mode selected heuristic G_E___041_C18_F1_PI_AE_Q4_CS_SP_S0Y
% 7.57/2.32 # and selection function SelectMaxLComplexAvoidPosPred.
% 7.57/2.32 #
% 7.57/2.32 # Preprocessing time : 0.013 s
% 7.57/2.32
% 7.57/2.32 # Proof found!
% 7.57/2.32 # SZS status Theorem
% 7.57/2.32 # SZS output start CNFRefutation
% See solution above
% 7.57/2.32 # Training examples: 0 positive, 0 negative
% 7.57/2.32
% 7.57/2.32 # -------------------------------------------------
% 7.57/2.32 # User time : 0.013 s
% 7.57/2.32 # System time : 0.008 s
% 7.57/2.32 # Total time : 0.021 s
% 7.57/2.32 # Maximum resident set size: 7124 pages
% 7.57/2.32
%------------------------------------------------------------------------------