TSTP Solution File: SET961+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SET961+1 : TPTP v8.1.0. Bugfixed v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n020.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:32 EDT 2022
% Result : Theorem 8.41s 2.47s
% Output : CNFRefutation 8.41s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 10
% Syntax : Number of clauses : 32 ( 11 unt; 5 nHn; 27 RR)
% Number of literals : 65 ( 18 equ; 33 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 : 7 ( 7 usr; 3 con; 0-2 aty)
% Number of variables : 51 ( 13 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/sandbox2/tmp/enigma-theBenchmark.p-8ywov_yj/input.p',i_0_9) ).
cnf(i_0_16,negated_conjecture,
cartesian_product2(esk4_0,esk5_0) = cartesian_product2(esk5_0,esk4_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-8ywov_yj/input.p',i_0_16) ).
cnf(i_0_10,plain,
( in(X1,X2)
| ~ in(unordered_pair(unordered_pair(X1,X3),singleton(X1)),cartesian_product2(X2,X4)) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-8ywov_yj/input.p',i_0_10) ).
cnf(i_0_4,plain,
( X1 != empty_set
| ~ in(X2,X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-8ywov_yj/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/sandbox2/tmp/enigma-theBenchmark.p-8ywov_yj/input.p',i_0_8) ).
cnf(i_0_17,plain,
( X1 = X2
| in(esk6_2(X1,X2),X2)
| in(esk6_2(X1,X2),X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-8ywov_yj/input.p',i_0_17) ).
cnf(i_0_15,negated_conjecture,
empty_set != esk4_0,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-8ywov_yj/input.p',i_0_15) ).
cnf(i_0_14,negated_conjecture,
empty_set != esk5_0,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-8ywov_yj/input.p',i_0_14) ).
cnf(i_0_18,plain,
( X1 = X2
| ~ in(esk6_2(X1,X2),X2)
| ~ in(esk6_2(X1,X2),X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-8ywov_yj/input.p',i_0_18) ).
cnf(i_0_13,negated_conjecture,
esk4_0 != esk5_0,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-8ywov_yj/input.p',i_0_13) ).
cnf(c_0_29,plain,
( in(X1,X2)
| ~ in(unordered_pair(unordered_pair(X3,X1),singleton(X3)),cartesian_product2(X4,X2)) ),
i_0_9 ).
cnf(c_0_30,negated_conjecture,
cartesian_product2(esk4_0,esk5_0) = cartesian_product2(esk5_0,esk4_0),
i_0_16 ).
cnf(c_0_31,plain,
( in(X1,X2)
| ~ in(unordered_pair(unordered_pair(X1,X3),singleton(X1)),cartesian_product2(X2,X4)) ),
i_0_10 ).
cnf(c_0_32,plain,
( X1 != empty_set
| ~ in(X2,X1) ),
i_0_4 ).
cnf(c_0_33,negated_conjecture,
( in(X1,esk5_0)
| ~ in(unordered_pair(unordered_pair(X2,X1),singleton(X2)),cartesian_product2(esk5_0,esk4_0)) ),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_34,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_35,negated_conjecture,
( in(X1,esk4_0)
| ~ in(unordered_pair(unordered_pair(X1,X2),singleton(X1)),cartesian_product2(esk5_0,esk4_0)) ),
inference(spm,[status(thm)],[c_0_31,c_0_30]) ).
cnf(c_0_36,plain,
~ in(X1,empty_set),
inference(er,[status(thm)],[c_0_32]) ).
cnf(c_0_37,plain,
( X1 = X2
| in(esk6_2(X1,X2),X2)
| in(esk6_2(X1,X2),X1) ),
i_0_17 ).
cnf(c_0_38,negated_conjecture,
( in(X1,esk5_0)
| ~ in(X1,esk4_0)
| ~ in(X2,esk5_0) ),
inference(spm,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_39,negated_conjecture,
( in(X1,esk4_0)
| ~ in(X2,esk4_0)
| ~ in(X1,esk5_0) ),
inference(spm,[status(thm)],[c_0_35,c_0_34]) ).
cnf(c_0_40,plain,
( empty_set = X1
| in(esk6_2(empty_set,X1),X1) ),
inference(spm,[status(thm)],[c_0_36,c_0_37]) ).
cnf(c_0_41,negated_conjecture,
empty_set != esk4_0,
i_0_15 ).
cnf(c_0_42,plain,
( X1 = esk4_0
| in(esk6_2(X1,esk4_0),esk5_0)
| in(esk6_2(X1,esk4_0),X1)
| ~ in(X2,esk5_0) ),
inference(spm,[status(thm)],[c_0_38,c_0_37]) ).
cnf(c_0_43,negated_conjecture,
empty_set != esk5_0,
i_0_14 ).
cnf(c_0_44,plain,
( X1 = X2
| ~ in(esk6_2(X1,X2),X2)
| ~ in(esk6_2(X1,X2),X1) ),
i_0_18 ).
cnf(c_0_45,plain,
( in(X1,esk4_0)
| ~ in(X1,esk5_0) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_40]),c_0_41]) ).
cnf(c_0_46,plain,
( X1 = esk4_0
| in(esk6_2(X1,esk4_0),esk5_0)
| in(esk6_2(X1,esk4_0),X1) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_40]),c_0_43]) ).
cnf(c_0_47,negated_conjecture,
esk4_0 != esk5_0,
i_0_13 ).
cnf(c_0_48,plain,
( X1 = esk4_0
| ~ in(esk6_2(X1,esk4_0),esk5_0)
| ~ in(esk6_2(X1,esk4_0),X1) ),
inference(spm,[status(thm)],[c_0_44,c_0_45]) ).
cnf(c_0_49,plain,
in(esk6_2(esk5_0,esk4_0),esk5_0),
inference(sr,[status(thm)],[inference(ef,[status(thm)],[c_0_46]),c_0_47]) ).
cnf(c_0_50,plain,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_49]),c_0_49])]),c_0_47]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : SET961+1 : TPTP v8.1.0. Bugfixed v4.0.0.
% 0.06/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n020.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Sun Jul 10 22:55:44 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.18/0.44 # ENIGMATIC: Selected complete mode:
% 8.41/2.47 # ENIGMATIC: Solved by autoschedule:
% 8.41/2.47 # No SInE strategy applied
% 8.41/2.47 # Trying AutoSched0 for 150 seconds
% 8.41/2.47 # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S0Y_ni
% 8.41/2.47 # and selection function SelectMaxLComplexAvoidPosPred.
% 8.41/2.47 #
% 8.41/2.47 # Preprocessing time : 0.024 s
% 8.41/2.47 # Presaturation interreduction done
% 8.41/2.47
% 8.41/2.47 # Proof found!
% 8.41/2.47 # SZS status Theorem
% 8.41/2.47 # SZS output start CNFRefutation
% See solution above
% 8.41/2.47 # Training examples: 0 positive, 0 negative
% 8.41/2.47
% 8.41/2.47 # -------------------------------------------------
% 8.41/2.47 # User time : 0.027 s
% 8.41/2.47 # System time : 0.008 s
% 8.41/2.47 # Total time : 0.035 s
% 8.41/2.47 # Maximum resident set size: 7116 pages
% 8.41/2.47
%------------------------------------------------------------------------------