TSTP Solution File: SET980+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SET980+1 : TPTP v8.1.0. Bugfixed v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n008.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 00:15:39 EDT 2022
% Result : Theorem 7.62s 2.16s
% Output : CNFRefutation 7.62s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 10
% Syntax : Number of clauses : 44 ( 11 unt; 8 nHn; 37 RR)
% Number of literals : 98 ( 26 equ; 50 neg)
% Maximal clause size : 4 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 5 con; 0-2 aty)
% Number of variables : 66 ( 18 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_9,plain,
( in(X1,X2)
| ~ in(unordered_pair(unordered_pair(X3,X1),singleton(X3)),cartesian_product2(X4,X2)) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-96oji2j3/input.p',i_0_9) ).
cnf(i_0_19,negated_conjecture,
cartesian_product2(esk4_0,esk5_0) = cartesian_product2(esk6_0,esk7_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-96oji2j3/input.p',i_0_19) ).
cnf(i_0_4,plain,
( X1 != empty_set
| ~ in(X2,X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-96oji2j3/input.p',i_0_4) ).
cnf(i_0_8,plain,
( in(unordered_pair(unordered_pair(X1,X2),singleton(X1)),cartesian_product2(X3,X4))
| ~ in(X2,X4)
| ~ in(X1,X3) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-96oji2j3/input.p',i_0_8) ).
cnf(i_0_20,plain,
( X1 = X2
| in(esk8_2(X1,X2),X2)
| in(esk8_2(X1,X2),X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-96oji2j3/input.p',i_0_20) ).
cnf(i_0_10,plain,
( in(X1,X2)
| ~ in(unordered_pair(unordered_pair(X1,X3),singleton(X1)),cartesian_product2(X2,X4)) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-96oji2j3/input.p',i_0_10) ).
cnf(i_0_18,negated_conjecture,
empty_set != esk4_0,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-96oji2j3/input.p',i_0_18) ).
cnf(i_0_17,negated_conjecture,
empty_set != esk5_0,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-96oji2j3/input.p',i_0_17) ).
cnf(i_0_21,plain,
( X1 = X2
| ~ in(esk8_2(X1,X2),X2)
| ~ in(esk8_2(X1,X2),X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-96oji2j3/input.p',i_0_21) ).
cnf(i_0_16,negated_conjecture,
( esk4_0 != esk6_0
| esk5_0 != esk7_0 ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-96oji2j3/input.p',i_0_16) ).
cnf(c_0_32,plain,
( in(X1,X2)
| ~ in(unordered_pair(unordered_pair(X3,X1),singleton(X3)),cartesian_product2(X4,X2)) ),
i_0_9 ).
cnf(c_0_33,negated_conjecture,
cartesian_product2(esk4_0,esk5_0) = cartesian_product2(esk6_0,esk7_0),
i_0_19 ).
cnf(c_0_34,plain,
( X1 != empty_set
| ~ in(X2,X1) ),
i_0_4 ).
cnf(c_0_35,plain,
( in(unordered_pair(unordered_pair(X1,X2),singleton(X1)),cartesian_product2(X3,X4))
| ~ in(X2,X4)
| ~ in(X1,X3) ),
i_0_8 ).
cnf(c_0_36,negated_conjecture,
( in(X1,esk7_0)
| ~ in(unordered_pair(unordered_pair(X2,X1),singleton(X2)),cartesian_product2(esk4_0,esk5_0)) ),
inference(spm,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_37,plain,
~ in(X1,empty_set),
inference(er,[status(thm)],[c_0_34]) ).
cnf(c_0_38,plain,
( X1 = X2
| in(esk8_2(X1,X2),X2)
| in(esk8_2(X1,X2),X1) ),
i_0_20 ).
cnf(c_0_39,plain,
( in(X1,X2)
| ~ in(unordered_pair(unordered_pair(X1,X3),singleton(X1)),cartesian_product2(X2,X4)) ),
i_0_10 ).
cnf(c_0_40,negated_conjecture,
( in(unordered_pair(unordered_pair(X1,X2),singleton(X1)),cartesian_product2(esk4_0,esk5_0))
| ~ in(X2,esk7_0)
| ~ in(X1,esk6_0) ),
inference(spm,[status(thm)],[c_0_35,c_0_33]) ).
cnf(c_0_41,negated_conjecture,
( in(X1,esk7_0)
| ~ in(X1,esk5_0)
| ~ in(X2,esk4_0) ),
inference(spm,[status(thm)],[c_0_36,c_0_35]) ).
cnf(c_0_42,plain,
( empty_set = X1
| in(esk8_2(empty_set,X1),X1) ),
inference(spm,[status(thm)],[c_0_37,c_0_38]) ).
cnf(c_0_43,negated_conjecture,
empty_set != esk4_0,
i_0_18 ).
cnf(c_0_44,plain,
( in(X1,esk4_0)
| ~ in(X2,esk7_0)
| ~ in(X1,esk6_0) ),
inference(spm,[status(thm)],[c_0_39,c_0_40]) ).
cnf(c_0_45,plain,
( in(X1,esk7_0)
| ~ in(X1,esk5_0) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_42]),c_0_43]) ).
cnf(c_0_46,negated_conjecture,
( in(X1,esk6_0)
| ~ in(unordered_pair(unordered_pair(X1,X2),singleton(X1)),cartesian_product2(esk4_0,esk5_0)) ),
inference(spm,[status(thm)],[c_0_39,c_0_33]) ).
cnf(c_0_47,plain,
( in(X1,esk4_0)
| ~ in(X1,esk6_0)
| ~ in(X2,esk5_0) ),
inference(spm,[status(thm)],[c_0_44,c_0_45]) ).
cnf(c_0_48,plain,
( in(X1,esk6_0)
| ~ in(X2,esk5_0)
| ~ in(X1,esk4_0) ),
inference(spm,[status(thm)],[c_0_46,c_0_35]) ).
cnf(c_0_49,negated_conjecture,
empty_set != esk5_0,
i_0_17 ).
cnf(c_0_50,plain,
( X1 = esk6_0
| in(esk8_2(X1,esk6_0),esk4_0)
| in(esk8_2(X1,esk6_0),X1)
| ~ in(X2,esk5_0) ),
inference(spm,[status(thm)],[c_0_47,c_0_38]) ).
cnf(c_0_51,plain,
( X1 = X2
| ~ in(esk8_2(X1,X2),X2)
| ~ in(esk8_2(X1,X2),X1) ),
i_0_21 ).
cnf(c_0_52,plain,
( in(X1,esk6_0)
| ~ in(X1,esk4_0) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_42]),c_0_49]) ).
cnf(c_0_53,plain,
( X1 = esk6_0
| in(esk8_2(X1,esk6_0),esk4_0)
| in(esk8_2(X1,esk6_0),X1) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_42]),c_0_49]) ).
cnf(c_0_54,plain,
( X1 = esk6_0
| ~ in(esk8_2(X1,esk6_0),esk4_0)
| ~ in(esk8_2(X1,esk6_0),X1) ),
inference(spm,[status(thm)],[c_0_51,c_0_52]) ).
cnf(c_0_55,plain,
( esk6_0 = esk4_0
| in(esk8_2(esk4_0,esk6_0),esk4_0) ),
inference(ef,[status(thm)],[c_0_53]) ).
cnf(c_0_56,plain,
( in(X1,esk5_0)
| ~ in(X1,esk7_0)
| ~ in(X2,esk6_0) ),
inference(spm,[status(thm)],[c_0_32,c_0_40]) ).
cnf(c_0_57,plain,
esk6_0 = esk4_0,
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_55]),c_0_55]) ).
cnf(c_0_58,plain,
( in(X1,esk5_0)
| ~ in(X1,esk7_0)
| ~ in(X2,esk4_0) ),
inference(rw,[status(thm)],[c_0_56,c_0_57]) ).
cnf(c_0_59,plain,
( X1 = esk7_0
| in(esk8_2(X1,esk7_0),esk5_0)
| in(esk8_2(X1,esk7_0),X1)
| ~ in(X2,esk4_0) ),
inference(spm,[status(thm)],[c_0_58,c_0_38]) ).
cnf(c_0_60,negated_conjecture,
( esk4_0 != esk6_0
| esk5_0 != esk7_0 ),
i_0_16 ).
cnf(c_0_61,plain,
( X1 = esk7_0
| in(esk8_2(X1,esk7_0),esk5_0)
| in(esk8_2(X1,esk7_0),X1) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_59,c_0_42]),c_0_43]) ).
cnf(c_0_62,negated_conjecture,
esk7_0 != esk5_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_60,c_0_57])]) ).
cnf(c_0_63,plain,
( X1 = esk7_0
| ~ in(esk8_2(X1,esk7_0),esk5_0)
| ~ in(esk8_2(X1,esk7_0),X1) ),
inference(spm,[status(thm)],[c_0_51,c_0_45]) ).
cnf(c_0_64,plain,
in(esk8_2(esk5_0,esk7_0),esk5_0),
inference(sr,[status(thm)],[inference(ef,[status(thm)],[c_0_61]),c_0_62]) ).
cnf(c_0_65,plain,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_63,c_0_64]),c_0_64])]),c_0_62]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SET980+1 : TPTP v8.1.0. Bugfixed v4.0.0.
% 0.03/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.34 % Computer : n008.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Sun Jul 10 20:08:40 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.19/0.45 # ENIGMATIC: Selected complete mode:
% 7.62/2.16 # ENIGMATIC: Solved by autoschedule:
% 7.62/2.16 # No SInE strategy applied
% 7.62/2.16 # Trying AutoSched0 for 150 seconds
% 7.62/2.16 # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S0Y_ni
% 7.62/2.16 # and selection function SelectMaxLComplexAvoidPosPred.
% 7.62/2.16 #
% 7.62/2.16 # Preprocessing time : 0.012 s
% 7.62/2.16 # Presaturation interreduction done
% 7.62/2.16
% 7.62/2.16 # Proof found!
% 7.62/2.16 # SZS status Theorem
% 7.62/2.16 # SZS output start CNFRefutation
% See solution above
% 7.62/2.16 # Training examples: 0 positive, 0 negative
% 7.62/2.16
% 7.62/2.16 # -------------------------------------------------
% 7.62/2.16 # User time : 0.021 s
% 7.62/2.16 # System time : 0.003 s
% 7.62/2.16 # Total time : 0.024 s
% 7.62/2.16 # Maximum resident set size: 7124 pages
% 7.62/2.16
%------------------------------------------------------------------------------