TSTP Solution File: SYN349+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SYN349+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:33 EDT 2022
% Result : Theorem 7.46s 2.37s
% Output : CNFRefutation 7.46s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 6
% Syntax : Number of clauses : 17 ( 4 unt; 7 nHn; 12 RR)
% Number of literals : 46 ( 0 equ; 21 neg)
% Maximal clause size : 4 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 2 ( 2 usr; 0 con; 1-2 aty)
% Number of variables : 28 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_3,negated_conjecture,
( big_f(X1,esk2_2(X2,X1))
| big_f(X2,esk2_2(X2,X1))
| big_f(esk2_2(X2,X1),X1)
| big_f(esk2_2(X2,X1),esk1_1(X2)) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-msoul1fr/lgb.p',i_0_3) ).
cnf(i_0_10,negated_conjecture,
( big_f(esk1_1(X1),esk2_2(X1,X2))
| ~ big_f(X1,esk2_2(X1,X2)) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-msoul1fr/lgb.p',i_0_10) ).
cnf(i_0_5,negated_conjecture,
( big_f(X1,esk2_2(X2,X1))
| big_f(X2,esk2_2(X2,X1))
| ~ big_f(esk2_2(X2,X1),X1)
| ~ big_f(esk2_2(X2,X1),esk1_1(X2)) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-msoul1fr/lgb.p',i_0_5) ).
cnf(i_0_9,negated_conjecture,
( big_f(X1,esk2_2(X1,X2))
| ~ big_f(esk1_1(X1),esk2_2(X1,X2)) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-msoul1fr/lgb.p',i_0_9) ).
cnf(i_0_8,negated_conjecture,
( ~ big_f(X1,esk2_2(X2,X1))
| ~ big_f(X2,esk2_2(X2,X1))
| ~ big_f(esk2_2(X2,X1),X1)
| ~ big_f(esk2_2(X2,X1),esk1_1(X2)) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-msoul1fr/lgb.p',i_0_8) ).
cnf(i_0_2,negated_conjecture,
( big_f(esk2_2(X1,X2),X2)
| big_f(esk2_2(X1,X2),esk1_1(X1))
| ~ big_f(X2,esk2_2(X1,X2))
| ~ big_f(X1,esk2_2(X1,X2)) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-msoul1fr/lgb.p',i_0_2) ).
cnf(c_0_17,negated_conjecture,
( big_f(X1,esk2_2(X2,X1))
| big_f(X2,esk2_2(X2,X1))
| big_f(esk2_2(X2,X1),X1)
| big_f(esk2_2(X2,X1),esk1_1(X2)) ),
i_0_3 ).
cnf(c_0_18,negated_conjecture,
( big_f(esk1_1(X1),esk2_2(X1,X2))
| ~ big_f(X1,esk2_2(X1,X2)) ),
i_0_10 ).
cnf(c_0_19,negated_conjecture,
( big_f(X1,esk2_2(X2,X1))
| big_f(X2,esk2_2(X2,X1))
| ~ big_f(esk2_2(X2,X1),X1)
| ~ big_f(esk2_2(X2,X1),esk1_1(X2)) ),
i_0_5 ).
cnf(c_0_20,negated_conjecture,
( big_f(esk2_2(X1,esk1_1(X1)),esk1_1(X1))
| big_f(esk1_1(X1),esk2_2(X1,esk1_1(X1))) ),
inference(csr,[status(thm)],[inference(ef,[status(thm)],[c_0_17]),c_0_18]) ).
cnf(c_0_21,negated_conjecture,
( big_f(X1,esk2_2(X1,X2))
| ~ big_f(esk1_1(X1),esk2_2(X1,X2)) ),
i_0_9 ).
cnf(c_0_22,negated_conjecture,
big_f(esk1_1(X1),esk2_2(X1,esk1_1(X1))),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_20]),c_0_18]) ).
cnf(c_0_23,negated_conjecture,
( ~ big_f(X1,esk2_2(X2,X1))
| ~ big_f(X2,esk2_2(X2,X1))
| ~ big_f(esk2_2(X2,X1),X1)
| ~ big_f(esk2_2(X2,X1),esk1_1(X2)) ),
i_0_8 ).
cnf(c_0_24,negated_conjecture,
big_f(X1,esk2_2(X1,esk1_1(X1))),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_25,negated_conjecture,
( big_f(esk2_2(X1,X2),X2)
| big_f(esk2_2(X1,X2),esk1_1(X1))
| ~ big_f(X2,esk2_2(X1,X2))
| ~ big_f(X1,esk2_2(X1,X2)) ),
i_0_2 ).
cnf(c_0_26,negated_conjecture,
~ big_f(esk2_2(X1,esk1_1(X1)),esk1_1(X1)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_22])]) ).
cnf(c_0_27,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_22]),c_0_24])]),c_0_26]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.14 % Problem : SYN349+1 : TPTP v8.1.0. Released v2.0.0.
% 0.08/0.14 % Command : enigmatic-eprover.py %s %d 1
% 0.14/0.36 % Computer : n006.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 600
% 0.14/0.36 % DateTime : Mon Jul 11 20:06:52 EDT 2022
% 0.14/0.36 % CPUTime :
% 0.22/0.48 # ENIGMATIC: Selected complete mode:
% 7.46/2.37 # ENIGMATIC: Solved by autoschedule-lgb:
% 7.46/2.37 # No SInE strategy applied
% 7.46/2.37 # Trying AutoSched0 for 150 seconds
% 7.46/2.37 # AutoSched0-Mode selected heuristic G_E___207_C18_F1_SE_CS_SP_PI_PS_S2SA
% 7.46/2.37 # and selection function SelectNewComplexAHP.
% 7.46/2.37 #
% 7.46/2.37 # Preprocessing time : 0.013 s
% 7.46/2.37 # Presaturation interreduction done
% 7.46/2.37
% 7.46/2.37 # Proof found!
% 7.46/2.37 # SZS status Theorem
% 7.46/2.37 # SZS output start CNFRefutation
% See solution above
% 7.46/2.37 # Training examples: 0 positive, 0 negative
% 7.46/2.37
% 7.46/2.37 # -------------------------------------------------
% 7.46/2.37 # User time : 0.013 s
% 7.46/2.37 # System time : 0.007 s
% 7.46/2.37 # Total time : 0.020 s
% 7.46/2.37 # Maximum resident set size: 7128 pages
% 7.46/2.37
%------------------------------------------------------------------------------