TSTP Solution File: SYN332+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SYN332+1 : TPTP v8.1.0. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n023.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:20 EDT 2022
% Result : Theorem 7.65s 2.31s
% Output : CNFRefutation 7.65s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 7
% Syntax : Number of clauses : 22 ( 4 unt; 8 nHn; 14 RR)
% Number of literals : 46 ( 0 equ; 20 neg)
% Maximal clause size : 3 ( 2 avg)
% Maximal term depth : 2 ( 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 : 39 ( 2 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_3,negated_conjecture,
( big_f(X1,X2)
| big_f(X2,X1)
| ~ big_f(esk1_2(X2,X1),X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ywk_grun/input.p',i_0_3) ).
cnf(i_0_11,negated_conjecture,
( big_f(esk1_2(X1,X2),X1)
| ~ big_f(X1,esk1_2(X1,X2)) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ywk_grun/input.p',i_0_11) ).
cnf(i_0_13,negated_conjecture,
( big_f(X1,X2)
| big_f(X1,esk1_2(X1,X2)) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ywk_grun/input.p',i_0_13) ).
cnf(i_0_5,negated_conjecture,
( big_f(X1,X2)
| ~ big_f(X2,X1)
| ~ big_f(esk1_2(X1,X2),esk1_2(X1,X2)) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ywk_grun/input.p',i_0_5) ).
cnf(i_0_9,negated_conjecture,
( big_f(X1,esk1_2(X2,X1))
| ~ big_f(X2,esk1_2(X2,X1)) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ywk_grun/input.p',i_0_9) ).
cnf(i_0_12,negated_conjecture,
( big_f(X1,X2)
| big_f(X2,esk1_2(X2,X1)) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ywk_grun/input.p',i_0_12) ).
cnf(i_0_4,negated_conjecture,
( ~ big_f(X1,X2)
| ~ big_f(X2,X1)
| ~ big_f(esk1_2(X2,X1),X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ywk_grun/input.p',i_0_4) ).
cnf(c_0_21,negated_conjecture,
( big_f(X1,X2)
| big_f(X2,X1)
| ~ big_f(esk1_2(X2,X1),X1) ),
i_0_3 ).
cnf(c_0_22,negated_conjecture,
( big_f(esk1_2(X1,X2),X1)
| ~ big_f(X1,esk1_2(X1,X2)) ),
i_0_11 ).
cnf(c_0_23,negated_conjecture,
( big_f(X1,X2)
| big_f(X1,esk1_2(X1,X2)) ),
i_0_13 ).
cnf(c_0_24,negated_conjecture,
( big_f(X1,X2)
| ~ big_f(X2,X1)
| ~ big_f(esk1_2(X1,X2),esk1_2(X1,X2)) ),
i_0_5 ).
cnf(c_0_25,negated_conjecture,
big_f(X1,X1),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_23]) ).
cnf(c_0_26,negated_conjecture,
( big_f(X1,esk1_2(X2,X1))
| ~ big_f(X2,esk1_2(X2,X1)) ),
i_0_9 ).
cnf(c_0_27,negated_conjecture,
( big_f(X1,X2)
| big_f(X2,esk1_2(X2,X1)) ),
i_0_12 ).
cnf(c_0_28,negated_conjecture,
( ~ big_f(X1,X2)
| ~ big_f(X2,X1)
| ~ big_f(esk1_2(X2,X1),X1) ),
i_0_4 ).
cnf(c_0_29,negated_conjecture,
( big_f(X1,X2)
| ~ big_f(X2,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_24,c_0_25])]) ).
cnf(c_0_30,negated_conjecture,
( big_f(X1,esk1_2(X2,X1))
| big_f(X1,X2) ),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_31,negated_conjecture,
( ~ big_f(X1,esk1_2(X1,X1))
| ~ big_f(X1,X1) ),
inference(spm,[status(thm)],[c_0_28,c_0_22]) ).
cnf(c_0_32,negated_conjecture,
( big_f(esk1_2(X1,X2),X2)
| big_f(X2,X1) ),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_33,negated_conjecture,
~ big_f(X1,esk1_2(X1,X1)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_31,c_0_25])]) ).
cnf(c_0_34,negated_conjecture,
big_f(X1,X2),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_32]),c_0_29]) ).
cnf(c_0_35,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_33,c_0_34])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.11 % Problem : SYN332+1 : TPTP v8.1.0. Released v2.0.0.
% 0.07/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.32 % Computer : n023.cluster.edu
% 0.12/0.32 % Model : x86_64 x86_64
% 0.12/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.32 % Memory : 8042.1875MB
% 0.12/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.32 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Tue Jul 12 04:46:56 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.18/0.43 # ENIGMATIC: Selected complete mode:
% 7.65/2.31 # ENIGMATIC: Solved by autoschedule:
% 7.65/2.31 # No SInE strategy applied
% 7.65/2.31 # Trying AutoSched0 for 150 seconds
% 7.65/2.31 # AutoSched0-Mode selected heuristic G_E___041_C18_F1_PI_AE_Q4_CS_SP_S0Y
% 7.65/2.31 # and selection function SelectMaxLComplexAvoidPosPred.
% 7.65/2.31 #
% 7.65/2.31 # Preprocessing time : 0.022 s
% 7.65/2.31
% 7.65/2.31 # Proof found!
% 7.65/2.31 # SZS status Theorem
% 7.65/2.31 # SZS output start CNFRefutation
% See solution above
% 7.65/2.31 # Training examples: 0 positive, 0 negative
% 7.65/2.31
% 7.65/2.31 # -------------------------------------------------
% 7.65/2.31 # User time : 0.024 s
% 7.65/2.31 # System time : 0.004 s
% 7.65/2.31 # Total time : 0.028 s
% 7.65/2.31 # Maximum resident set size: 7116 pages
% 7.65/2.31
%------------------------------------------------------------------------------