TSTP Solution File: SEU159+3 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SEU159+3 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n011.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:38:59 EDT 2022
% Result : Theorem 7.37s 2.36s
% Output : CNFRefutation 7.37s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 9
% Syntax : Number of clauses : 33 ( 8 unt; 10 nHn; 29 RR)
% Number of literals : 72 ( 19 equ; 33 neg)
% Maximal clause size : 4 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 51 ( 8 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_6,plain,
( in(X1,X2)
| X1 != X3
| X2 != unordered_pair(X4,X3) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-v0w04ht5/input.p',i_0_6) ).
cnf(i_0_11,plain,
( in(X1,X2)
| ~ in(X1,X3)
| ~ subset(X3,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-v0w04ht5/input.p',i_0_11) ).
cnf(i_0_7,plain,
( in(X1,X2)
| X1 != X3
| X2 != unordered_pair(X3,X4) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-v0w04ht5/input.p',i_0_7) ).
cnf(i_0_17,negated_conjecture,
( ~ in(esk5_0,esk7_0)
| ~ in(esk6_0,esk7_0)
| ~ subset(unordered_pair(esk5_0,esk6_0),esk7_0) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-v0w04ht5/input.p',i_0_17) ).
cnf(i_0_10,plain,
( subset(X1,X2)
| in(esk2_2(X1,X2),X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-v0w04ht5/input.p',i_0_10) ).
cnf(i_0_15,negated_conjecture,
( in(esk6_0,esk7_0)
| subset(unordered_pair(esk5_0,esk6_0),esk7_0) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-v0w04ht5/input.p',i_0_15) ).
cnf(i_0_16,negated_conjecture,
( in(esk5_0,esk7_0)
| subset(unordered_pair(esk5_0,esk6_0),esk7_0) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-v0w04ht5/input.p',i_0_16) ).
cnf(i_0_8,plain,
( X1 = X2
| X1 = X3
| X4 != unordered_pair(X3,X2)
| ~ in(X1,X4) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-v0w04ht5/input.p',i_0_8) ).
cnf(i_0_9,plain,
( subset(X1,X2)
| ~ in(esk2_2(X1,X2),X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-v0w04ht5/input.p',i_0_9) ).
cnf(c_0_27,plain,
( in(X1,X2)
| X1 != X3
| X2 != unordered_pair(X4,X3) ),
i_0_6 ).
cnf(c_0_28,plain,
( in(X1,X2)
| ~ in(X1,X3)
| ~ subset(X3,X2) ),
i_0_11 ).
cnf(c_0_29,plain,
in(X1,unordered_pair(X2,X1)),
inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_27])]) ).
cnf(c_0_30,plain,
( in(X1,X2)
| X1 != X3
| X2 != unordered_pair(X3,X4) ),
i_0_7 ).
cnf(c_0_31,negated_conjecture,
( ~ in(esk5_0,esk7_0)
| ~ in(esk6_0,esk7_0)
| ~ subset(unordered_pair(esk5_0,esk6_0),esk7_0) ),
i_0_17 ).
cnf(c_0_32,plain,
( subset(X1,X2)
| in(esk2_2(X1,X2),X1) ),
i_0_10 ).
cnf(c_0_33,plain,
( in(X1,X2)
| ~ subset(unordered_pair(X3,X1),X2) ),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_34,negated_conjecture,
( in(esk6_0,esk7_0)
| subset(unordered_pair(esk5_0,esk6_0),esk7_0) ),
i_0_15 ).
cnf(c_0_35,plain,
in(X1,unordered_pair(X1,X2)),
inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_30])]) ).
cnf(c_0_36,negated_conjecture,
( in(esk2_2(unordered_pair(esk5_0,esk6_0),esk7_0),unordered_pair(esk5_0,esk6_0))
| ~ in(esk5_0,esk7_0)
| ~ in(esk6_0,esk7_0) ),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_37,negated_conjecture,
in(esk6_0,esk7_0),
inference(spm,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_38,plain,
( in(X1,X2)
| ~ subset(unordered_pair(X1,X3),X2) ),
inference(spm,[status(thm)],[c_0_28,c_0_35]) ).
cnf(c_0_39,negated_conjecture,
( in(esk5_0,esk7_0)
| subset(unordered_pair(esk5_0,esk6_0),esk7_0) ),
i_0_16 ).
cnf(c_0_40,plain,
( X1 = X2
| X1 = X3
| X4 != unordered_pair(X3,X2)
| ~ in(X1,X4) ),
i_0_8 ).
cnf(c_0_41,negated_conjecture,
( in(esk2_2(unordered_pair(esk5_0,esk6_0),esk7_0),unordered_pair(esk5_0,esk6_0))
| ~ in(esk5_0,esk7_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_36,c_0_37])]) ).
cnf(c_0_42,negated_conjecture,
in(esk5_0,esk7_0),
inference(spm,[status(thm)],[c_0_38,c_0_39]) ).
cnf(c_0_43,plain,
( X1 = X2
| X1 = X3
| ~ in(X1,unordered_pair(X2,X3)) ),
inference(er,[status(thm)],[c_0_40]) ).
cnf(c_0_44,negated_conjecture,
in(esk2_2(unordered_pair(esk5_0,esk6_0),esk7_0),unordered_pair(esk5_0,esk6_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_41,c_0_42])]) ).
cnf(c_0_45,negated_conjecture,
( ~ in(esk5_0,esk7_0)
| ~ subset(unordered_pair(esk5_0,esk6_0),esk7_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_31,c_0_37])]) ).
cnf(c_0_46,plain,
( subset(X1,X2)
| ~ in(esk2_2(X1,X2),X2) ),
i_0_9 ).
cnf(c_0_47,plain,
( esk2_2(unordered_pair(esk5_0,esk6_0),esk7_0) = esk5_0
| esk2_2(unordered_pair(esk5_0,esk6_0),esk7_0) = esk6_0 ),
inference(spm,[status(thm)],[c_0_43,c_0_44]) ).
cnf(c_0_48,negated_conjecture,
~ subset(unordered_pair(esk5_0,esk6_0),esk7_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_45,c_0_42])]) ).
cnf(c_0_49,plain,
esk2_2(unordered_pair(esk5_0,esk6_0),esk7_0) = esk5_0,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_47]),c_0_37])]),c_0_48]) ).
cnf(c_0_50,plain,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_49]),c_0_42])]),c_0_48]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.13/0.13 % Problem : SEU159+3 : TPTP v8.1.0. Released v3.2.0.
% 0.13/0.14 % Command : enigmatic-eprover.py %s %d 1
% 0.15/0.35 % Computer : n011.cluster.edu
% 0.15/0.35 % Model : x86_64 x86_64
% 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35 % Memory : 8042.1875MB
% 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35 % CPULimit : 300
% 0.15/0.35 % WCLimit : 600
% 0.15/0.35 % DateTime : Sun Jun 19 00:50:10 EDT 2022
% 0.15/0.35 % CPUTime :
% 0.22/0.46 # ENIGMATIC: Selected complete mode:
% 7.37/2.36 # ENIGMATIC: Solved by autoschedule:
% 7.37/2.36 # No SInE strategy applied
% 7.37/2.36 # Trying AutoSched0 for 150 seconds
% 7.37/2.36 # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S011A
% 7.37/2.36 # and selection function PSelectDiffNegLit.
% 7.37/2.36 #
% 7.37/2.36 # Preprocessing time : 0.013 s
% 7.37/2.36 # Presaturation interreduction done
% 7.37/2.36
% 7.37/2.36 # Proof found!
% 7.37/2.36 # SZS status Theorem
% 7.37/2.36 # SZS output start CNFRefutation
% See solution above
% 7.37/2.36 # Training examples: 0 positive, 0 negative
% 7.37/2.36
% 7.37/2.36 # -------------------------------------------------
% 7.37/2.36 # User time : 0.016 s
% 7.37/2.36 # System time : 0.003 s
% 7.37/2.36 # Total time : 0.019 s
% 7.37/2.36 # Maximum resident set size: 7120 pages
% 7.37/2.36
%------------------------------------------------------------------------------