TSTP Solution File: SYN345+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SYN345+1 : TPTP v8.1.0. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n007.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:30 EDT 2022
% Result : Theorem 4.61s 2.16s
% Output : CNFRefutation 4.61s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 6
% Syntax : Number of clauses : 21 ( 6 unt; 5 nHn; 14 RR)
% Number of literals : 46 ( 0 equ; 24 neg)
% Maximal clause size : 3 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-3 aty)
% Number of functors : 3 ( 3 usr; 2 con; 0-2 aty)
% Number of variables : 30 ( 16 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_6,negated_conjecture,
( big_f(esk1_0,esk2_0,esk2_0)
| ~ big_f(X1,X2,esk3_2(X2,X1))
| ~ big_f(esk1_0,esk1_0,esk2_0) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-tn988kws/input.p',i_0_6) ).
cnf(i_0_3,negated_conjecture,
big_f(X1,X2,esk3_2(X1,X2)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-tn988kws/input.p',i_0_3) ).
cnf(i_0_1,negated_conjecture,
( big_f(esk1_0,esk1_0,esk2_0)
| big_f(esk1_0,esk2_0,esk2_0)
| ~ big_f(esk2_0,esk2_0,X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-tn988kws/input.p',i_0_1) ).
cnf(i_0_2,negated_conjecture,
( ~ big_f(esk2_0,esk2_0,X1)
| ~ big_f(esk1_0,esk1_0,esk2_0)
| ~ big_f(esk1_0,esk2_0,esk2_0) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-tn988kws/input.p',i_0_2) ).
cnf(i_0_5,negated_conjecture,
( big_f(esk2_0,X1,X2)
| big_f(esk1_0,esk1_0,esk2_0)
| ~ big_f(esk1_0,esk2_0,esk2_0) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-tn988kws/input.p',i_0_5) ).
cnf(i_0_4,negated_conjecture,
( big_f(esk1_0,esk1_0,esk2_0)
| ~ big_f(esk1_0,esk2_0,esk2_0)
| ~ big_f(X1,esk3_2(X1,X2),esk3_2(X1,X2)) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-tn988kws/input.p',i_0_4) ).
cnf(c_0_13,negated_conjecture,
( big_f(esk1_0,esk2_0,esk2_0)
| ~ big_f(X1,X2,esk3_2(X2,X1))
| ~ big_f(esk1_0,esk1_0,esk2_0) ),
i_0_6 ).
cnf(c_0_14,negated_conjecture,
big_f(X1,X2,esk3_2(X1,X2)),
i_0_3 ).
cnf(c_0_15,negated_conjecture,
( big_f(esk1_0,esk1_0,esk2_0)
| big_f(esk1_0,esk2_0,esk2_0)
| ~ big_f(esk2_0,esk2_0,X1) ),
i_0_1 ).
cnf(c_0_16,negated_conjecture,
( big_f(esk1_0,esk2_0,esk2_0)
| ~ big_f(esk1_0,esk1_0,esk2_0) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_17,negated_conjecture,
( ~ big_f(esk2_0,esk2_0,X1)
| ~ big_f(esk1_0,esk1_0,esk2_0)
| ~ big_f(esk1_0,esk2_0,esk2_0) ),
i_0_2 ).
cnf(c_0_18,negated_conjecture,
big_f(esk1_0,esk2_0,esk2_0),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_14]),c_0_16]) ).
cnf(c_0_19,negated_conjecture,
( big_f(esk2_0,X1,X2)
| big_f(esk1_0,esk1_0,esk2_0)
| ~ big_f(esk1_0,esk2_0,esk2_0) ),
i_0_5 ).
cnf(c_0_20,negated_conjecture,
( ~ big_f(esk1_0,esk1_0,esk2_0)
| ~ big_f(esk2_0,esk2_0,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_17,c_0_18])]) ).
cnf(c_0_21,negated_conjecture,
( big_f(esk1_0,esk1_0,esk2_0)
| big_f(esk2_0,X1,X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_19,c_0_18])]) ).
cnf(c_0_22,negated_conjecture,
( big_f(esk2_0,X1,X2)
| ~ big_f(esk2_0,esk2_0,X3) ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_23,negated_conjecture,
( big_f(esk1_0,esk1_0,esk2_0)
| ~ big_f(esk1_0,esk2_0,esk2_0)
| ~ big_f(X1,esk3_2(X1,X2),esk3_2(X1,X2)) ),
i_0_4 ).
cnf(c_0_24,negated_conjecture,
big_f(esk2_0,X1,X2),
inference(spm,[status(thm)],[c_0_22,c_0_14]) ).
cnf(c_0_25,negated_conjecture,
( big_f(esk1_0,esk1_0,esk2_0)
| ~ big_f(X1,esk3_2(X1,X2),esk3_2(X1,X2)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_23,c_0_18])]) ).
cnf(c_0_26,negated_conjecture,
~ big_f(esk1_0,esk1_0,esk2_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_20,c_0_24])]) ).
cnf(c_0_27,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_24]),c_0_26]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SYN345+1 : TPTP v8.1.0. Released v2.0.0.
% 0.07/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.13/0.33 % Computer : n007.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 18:24:20 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.19/0.45 # ENIGMATIC: Selected complete mode:
% 4.61/2.16 # ENIGMATIC: Solved by autoschedule:
% 4.61/2.16 # No SInE strategy applied
% 4.61/2.16 # Trying AutoSched0 for 150 seconds
% 4.61/2.16 # AutoSched0-Mode selected heuristic G_E___041_C18_F1_PI_AE_Q4_CS_SP_S0Y
% 4.61/2.16 # and selection function SelectMaxLComplexAvoidPosPred.
% 4.61/2.16 #
% 4.61/2.16 # Preprocessing time : 0.012 s
% 4.61/2.16
% 4.61/2.16 # Proof found!
% 4.61/2.16 # SZS status Theorem
% 4.61/2.16 # SZS output start CNFRefutation
% See solution above
% 4.61/2.16 # Training examples: 0 positive, 0 negative
% 4.61/2.16
% 4.61/2.16 # -------------------------------------------------
% 4.61/2.16 # User time : 0.013 s
% 4.61/2.16 # System time : 0.003 s
% 4.61/2.16 # Total time : 0.015 s
% 4.61/2.16 # Maximum resident set size: 7120 pages
% 4.61/2.16
%------------------------------------------------------------------------------