TSTP Solution File: SEU186+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SEU186+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n032.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 : Tue Jul 19 08:39:18 EDT 2022
% Result : Theorem 4.05s 2.11s
% Output : CNFRefutation 4.05s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 8
% Syntax : Number of clauses : 25 ( 15 unt; 5 nHn; 20 RR)
% Number of literals : 41 ( 12 equ; 17 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 2 con; 0-2 aty)
% Number of variables : 26 ( 3 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_6,plain,
( unordered_pair(unordered_pair(esk1_2(X1,X2),esk2_2(X1,X2)),singleton(esk1_2(X1,X2))) = X2
| ~ relation(X1)
| ~ in(X2,X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-0acfofr5/input.p',i_0_6) ).
cnf(i_0_3,plain,
unordered_pair(X1,X2) = unordered_pair(X2,X1),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-0acfofr5/input.p',i_0_3) ).
cnf(i_0_27,plain,
( empty(X1)
| in(X2,X1)
| ~ element(X2,X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-0acfofr5/input.p',i_0_27) ).
cnf(i_0_13,plain,
element(esk4_1(X1),X1),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-0acfofr5/input.p',i_0_13) ).
cnf(i_0_30,negated_conjecture,
relation(esk9_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-0acfofr5/input.p',i_0_30) ).
cnf(i_0_29,negated_conjecture,
~ in(unordered_pair(unordered_pair(X1,X2),singleton(X1)),esk9_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-0acfofr5/input.p',i_0_29) ).
cnf(i_0_31,plain,
( X1 = empty_set
| ~ empty(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-0acfofr5/input.p',i_0_31) ).
cnf(i_0_28,negated_conjecture,
esk9_0 != empty_set,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-0acfofr5/input.p',i_0_28) ).
cnf(c_0_40,plain,
( unordered_pair(unordered_pair(esk1_2(X1,X2),esk2_2(X1,X2)),singleton(esk1_2(X1,X2))) = X2
| ~ relation(X1)
| ~ in(X2,X1) ),
i_0_6 ).
cnf(c_0_41,plain,
unordered_pair(X1,X2) = unordered_pair(X2,X1),
i_0_3 ).
cnf(c_0_42,plain,
( empty(X1)
| in(X2,X1)
| ~ element(X2,X1) ),
i_0_27 ).
cnf(c_0_43,plain,
element(esk4_1(X1),X1),
i_0_13 ).
cnf(c_0_44,plain,
( unordered_pair(singleton(esk1_2(X1,X2)),unordered_pair(esk1_2(X1,X2),esk2_2(X1,X2))) = X2
| ~ in(X2,X1)
| ~ relation(X1) ),
inference(rw,[status(thm)],[c_0_40,c_0_41]) ).
cnf(c_0_45,plain,
( in(esk4_1(X1),X1)
| empty(X1) ),
inference(spm,[status(thm)],[c_0_42,c_0_43]) ).
cnf(c_0_46,plain,
( unordered_pair(singleton(esk1_2(X1,esk4_1(X1))),unordered_pair(esk1_2(X1,esk4_1(X1)),esk2_2(X1,esk4_1(X1)))) = esk4_1(X1)
| empty(X1)
| ~ relation(X1) ),
inference(spm,[status(thm)],[c_0_44,c_0_45]) ).
cnf(c_0_47,negated_conjecture,
relation(esk9_0),
i_0_30 ).
cnf(c_0_48,negated_conjecture,
~ in(unordered_pair(unordered_pair(X1,X2),singleton(X1)),esk9_0),
i_0_29 ).
cnf(c_0_49,plain,
( X1 = empty_set
| ~ empty(X1) ),
i_0_31 ).
cnf(c_0_50,negated_conjecture,
( unordered_pair(singleton(esk1_2(esk9_0,esk4_1(esk9_0))),unordered_pair(esk1_2(esk9_0,esk4_1(esk9_0)),esk2_2(esk9_0,esk4_1(esk9_0)))) = esk4_1(esk9_0)
| empty(esk9_0) ),
inference(spm,[status(thm)],[c_0_46,c_0_47]) ).
cnf(c_0_51,negated_conjecture,
esk9_0 != empty_set,
i_0_28 ).
cnf(c_0_52,plain,
~ in(unordered_pair(singleton(X1),unordered_pair(X1,X2)),esk9_0),
inference(spm,[status(thm)],[c_0_48,c_0_41]) ).
cnf(c_0_53,plain,
unordered_pair(singleton(esk1_2(esk9_0,esk4_1(esk9_0))),unordered_pair(esk1_2(esk9_0,esk4_1(esk9_0)),esk2_2(esk9_0,esk4_1(esk9_0)))) = esk4_1(esk9_0),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_50]),c_0_51]) ).
cnf(c_0_54,plain,
~ in(esk4_1(esk9_0),esk9_0),
inference(spm,[status(thm)],[c_0_52,c_0_53]) ).
cnf(c_0_55,plain,
empty(esk9_0),
inference(spm,[status(thm)],[c_0_54,c_0_45]) ).
cnf(c_0_56,plain,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_55]),c_0_51]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.10 % Problem : SEU186+1 : TPTP v8.1.0. Released v3.3.0.
% 0.00/0.10 % Command : enigmatic-eprover.py %s %d 1
% 0.10/0.29 % Computer : n032.cluster.edu
% 0.10/0.29 % Model : x86_64 x86_64
% 0.10/0.29 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.29 % Memory : 8042.1875MB
% 0.10/0.29 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.29 % CPULimit : 300
% 0.10/0.29 % WCLimit : 600
% 0.10/0.29 % DateTime : Sun Jun 19 15:17:34 EDT 2022
% 0.10/0.29 % CPUTime :
% 0.15/0.38 # ENIGMATIC: Selected complete mode:
% 4.05/2.11 # ENIGMATIC: Solved by autoschedule:
% 4.05/2.11 # No SInE strategy applied
% 4.05/2.11 # Trying AutoSched0 for 150 seconds
% 4.05/2.11 # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S04AI
% 4.05/2.11 # and selection function SelectComplexExceptUniqMaxHorn.
% 4.05/2.11 #
% 4.05/2.11 # Preprocessing time : 0.013 s
% 4.05/2.11 # Presaturation interreduction done
% 4.05/2.11
% 4.05/2.11 # Proof found!
% 4.05/2.11 # SZS status Theorem
% 4.05/2.11 # SZS output start CNFRefutation
% See solution above
% 4.05/2.11 # Training examples: 0 positive, 0 negative
% 4.05/2.11
% 4.05/2.11 # -------------------------------------------------
% 4.05/2.11 # User time : 0.014 s
% 4.05/2.11 # System time : 0.006 s
% 4.05/2.11 # Total time : 0.020 s
% 4.05/2.11 # Maximum resident set size: 7124 pages
% 4.05/2.11
%------------------------------------------------------------------------------