TSTP Solution File: SYN334+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SYN334+1 : TPTP v8.1.0. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n009.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:22 EDT 2022
% Result : Theorem 8.00s 2.43s
% Output : CNFRefutation 8.00s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 6
% Syntax : Number of clauses : 21 ( 2 unt; 4 nHn; 18 RR)
% Number of literals : 48 ( 0 equ; 28 neg)
% Maximal clause size : 3 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 1 ( 1 usr; 0 con; 2-2 aty)
% Number of variables : 40 ( 2 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_3,negated_conjecture,
( big_f(X1,X2)
| ~ big_g(esk1_2(X1,X2),esk1_2(X1,X2)) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-qbr3xm8m/input.p',i_0_3) ).
cnf(i_0_1,negated_conjecture,
( big_g(X1,X2)
| big_g(esk1_2(X1,X2),esk1_2(X1,X2)) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-qbr3xm8m/input.p',i_0_1) ).
cnf(i_0_6,negated_conjecture,
( big_f(X1,esk1_2(X1,X2))
| ~ big_f(X1,X2)
| ~ big_g(X2,esk1_2(X1,X2)) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-qbr3xm8m/input.p',i_0_6) ).
cnf(i_0_2,negated_conjecture,
( ~ big_g(X1,X2)
| ~ big_g(esk1_2(X1,X2),esk1_2(X1,X2)) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-qbr3xm8m/input.p',i_0_2) ).
cnf(i_0_5,negated_conjecture,
( big_g(esk1_2(X1,X2),esk1_2(X1,X2))
| ~ big_f(X1,X2)
| ~ big_f(esk1_2(X1,X2),esk1_2(X1,X2)) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-qbr3xm8m/input.p',i_0_5) ).
cnf(i_0_7,negated_conjecture,
( big_g(X1,esk1_2(X2,X1))
| ~ big_f(X2,X1)
| ~ big_f(X2,esk1_2(X2,X1)) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-qbr3xm8m/input.p',i_0_7) ).
cnf(c_0_14,negated_conjecture,
( big_f(X1,X2)
| ~ big_g(esk1_2(X1,X2),esk1_2(X1,X2)) ),
i_0_3 ).
cnf(c_0_15,negated_conjecture,
( big_g(X1,X2)
| big_g(esk1_2(X1,X2),esk1_2(X1,X2)) ),
i_0_1 ).
cnf(c_0_16,negated_conjecture,
( big_f(X1,esk1_2(X1,X2))
| ~ big_f(X1,X2)
| ~ big_g(X2,esk1_2(X1,X2)) ),
i_0_6 ).
cnf(c_0_17,negated_conjecture,
( big_g(X1,X2)
| big_f(X1,X2) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_18,negated_conjecture,
( ~ big_g(X1,X2)
| ~ big_g(esk1_2(X1,X2),esk1_2(X1,X2)) ),
i_0_2 ).
cnf(c_0_19,negated_conjecture,
( big_g(esk1_2(X1,X2),esk1_2(X1,X2))
| ~ big_f(X1,X2)
| ~ big_f(esk1_2(X1,X2),esk1_2(X1,X2)) ),
i_0_5 ).
cnf(c_0_20,negated_conjecture,
( big_f(X1,esk1_2(X2,X1))
| big_f(X2,esk1_2(X2,X1))
| ~ big_f(X2,X1) ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_21,negated_conjecture,
( big_f(esk1_2(X1,X2),esk1_2(X1,X2))
| ~ big_g(X1,X2) ),
inference(spm,[status(thm)],[c_0_18,c_0_17]) ).
cnf(c_0_22,negated_conjecture,
( ~ big_g(X1,X2)
| ~ big_f(esk1_2(X1,X2),esk1_2(X1,X2))
| ~ big_f(X1,X2) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_23,negated_conjecture,
( big_g(X1,esk1_2(X2,X1))
| ~ big_f(X2,X1)
| ~ big_f(X2,esk1_2(X2,X1)) ),
i_0_7 ).
cnf(c_0_24,negated_conjecture,
( big_f(esk1_2(X1,X2),esk1_2(esk1_2(X1,X2),esk1_2(X1,X2)))
| ~ big_g(X1,X2) ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_25,negated_conjecture,
( ~ big_g(X1,X2)
| ~ big_f(X1,X2) ),
inference(spm,[status(thm)],[c_0_22,c_0_21]) ).
cnf(c_0_26,negated_conjecture,
( big_g(esk1_2(X1,X2),esk1_2(esk1_2(X1,X2),esk1_2(X1,X2)))
| ~ big_g(X1,X2) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_21]) ).
cnf(c_0_27,negated_conjecture,
~ big_g(X1,X2),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_24]) ).
cnf(c_0_28,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(sr,[status(thm)],[c_0_15,c_0_27]),c_0_27]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.12 % Problem : SYN334+1 : TPTP v8.1.0. Released v2.0.0.
% 0.08/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n009.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 : Mon Jul 11 20:18:53 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.18/0.44 # ENIGMATIC: Selected complete mode:
% 8.00/2.43 # ENIGMATIC: Solved by autoschedule:
% 8.00/2.43 # No SInE strategy applied
% 8.00/2.43 # Trying AutoSched0 for 150 seconds
% 8.00/2.43 # AutoSched0-Mode selected heuristic G_E___041_C18_F1_PI_AE_Q4_CS_SP_S0Y
% 8.00/2.43 # and selection function SelectMaxLComplexAvoidPosPred.
% 8.00/2.43 #
% 8.00/2.43 # Preprocessing time : 0.023 s
% 8.00/2.43
% 8.00/2.43 # Proof found!
% 8.00/2.43 # SZS status Theorem
% 8.00/2.43 # SZS output start CNFRefutation
% See solution above
% 8.00/2.43 # Training examples: 0 positive, 0 negative
% 8.00/2.43
% 8.00/2.43 # -------------------------------------------------
% 8.00/2.43 # User time : 0.024 s
% 8.00/2.43 # System time : 0.006 s
% 8.00/2.43 # Total time : 0.030 s
% 8.00/2.43 # Maximum resident set size: 7120 pages
% 8.00/2.43
%------------------------------------------------------------------------------