TSTP Solution File: SET955+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SET955+1 : TPTP v8.1.0. Bugfixed v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n026.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:30 EDT 2022
% Result : Theorem 8.39s 3.43s
% Output : CNFRefutation 8.39s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 10
% Syntax : Number of clauses : 36 ( 7 unt; 3 nHn; 31 RR)
% Number of literals : 89 ( 22 equ; 49 neg)
% Maximal clause size : 5 ( 2 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 4 con; 0-4 aty)
% Number of variables : 87 ( 4 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_7,plain,
( in(X1,X2)
| X2 != cartesian_product2(X3,X4)
| X1 != unordered_pair(unordered_pair(X5,X6),singleton(X5))
| ~ in(X6,X4)
| ~ in(X5,X3) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-lj2bj4d2/input.p',i_0_7) ).
cnf(i_0_17,negated_conjecture,
( in(unordered_pair(unordered_pair(X1,X2),singleton(X1)),cartesian_product2(esk10_0,esk11_0))
| ~ in(unordered_pair(unordered_pair(X1,X2),singleton(X1)),cartesian_product2(esk8_0,esk9_0)) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-lj2bj4d2/input.p',i_0_17) ).
cnf(i_0_2,plain,
unordered_pair(X1,X2) = unordered_pair(X2,X1),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-lj2bj4d2/input.p',i_0_2) ).
cnf(i_0_8,plain,
( unordered_pair(unordered_pair(esk1_4(X1,X2,X3,X4),esk2_4(X1,X2,X3,X4)),singleton(esk1_4(X1,X2,X3,X4))) = X4
| X3 != cartesian_product2(X1,X2)
| ~ in(X4,X3) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-lj2bj4d2/input.p',i_0_8) ).
cnf(i_0_9,plain,
( in(esk2_4(X1,X2,X3,X4),X2)
| X3 != cartesian_product2(X1,X2)
| ~ in(X4,X3) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-lj2bj4d2/input.p',i_0_9) ).
cnf(i_0_10,plain,
( in(esk1_4(X1,X2,X3,X4),X1)
| X3 != cartesian_product2(X1,X2)
| ~ in(X4,X3) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-lj2bj4d2/input.p',i_0_10) ).
cnf(i_0_16,negated_conjecture,
( in(unordered_pair(unordered_pair(X1,X2),singleton(X1)),cartesian_product2(esk8_0,esk9_0))
| ~ in(unordered_pair(unordered_pair(X1,X2),singleton(X1)),cartesian_product2(esk10_0,esk11_0)) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-lj2bj4d2/input.p',i_0_16) ).
cnf(i_0_18,plain,
( X1 = X2
| in(esk12_2(X1,X2),X2)
| in(esk12_2(X1,X2),X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-lj2bj4d2/input.p',i_0_18) ).
cnf(i_0_15,negated_conjecture,
cartesian_product2(esk10_0,esk11_0) != cartesian_product2(esk8_0,esk9_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-lj2bj4d2/input.p',i_0_15) ).
cnf(i_0_19,plain,
( X1 = X2
| ~ in(esk12_2(X1,X2),X2)
| ~ in(esk12_2(X1,X2),X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-lj2bj4d2/input.p',i_0_19) ).
cnf(c_0_30,plain,
( in(X1,X2)
| X2 != cartesian_product2(X3,X4)
| X1 != unordered_pair(unordered_pair(X5,X6),singleton(X5))
| ~ in(X6,X4)
| ~ in(X5,X3) ),
i_0_7 ).
cnf(c_0_31,negated_conjecture,
( in(unordered_pair(unordered_pair(X1,X2),singleton(X1)),cartesian_product2(esk10_0,esk11_0))
| ~ in(unordered_pair(unordered_pair(X1,X2),singleton(X1)),cartesian_product2(esk8_0,esk9_0)) ),
i_0_17 ).
cnf(c_0_32,plain,
( in(unordered_pair(unordered_pair(X1,X2),singleton(X1)),cartesian_product2(X3,X4))
| ~ in(X2,X4)
| ~ in(X1,X3) ),
inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_30])]) ).
cnf(c_0_33,negated_conjecture,
( in(unordered_pair(unordered_pair(X1,X2),singleton(X1)),cartesian_product2(esk10_0,esk11_0))
| ~ in(X2,esk9_0)
| ~ in(X1,esk8_0) ),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_34,plain,
unordered_pair(X1,X2) = unordered_pair(X2,X1),
i_0_2 ).
cnf(c_0_35,plain,
( unordered_pair(unordered_pair(esk1_4(X1,X2,X3,X4),esk2_4(X1,X2,X3,X4)),singleton(esk1_4(X1,X2,X3,X4))) = X4
| X3 != cartesian_product2(X1,X2)
| ~ in(X4,X3) ),
i_0_8 ).
cnf(c_0_36,plain,
( in(unordered_pair(singleton(X1),unordered_pair(X1,X2)),cartesian_product2(esk10_0,esk11_0))
| ~ in(X2,esk9_0)
| ~ in(X1,esk8_0) ),
inference(spm,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_37,plain,
( unordered_pair(singleton(esk1_4(X1,X2,cartesian_product2(X1,X2),X3)),unordered_pair(esk1_4(X1,X2,cartesian_product2(X1,X2),X3),esk2_4(X1,X2,cartesian_product2(X1,X2),X3))) = X3
| ~ in(X3,cartesian_product2(X1,X2)) ),
inference(rw,[status(thm)],[inference(er,[status(thm)],[c_0_35]),c_0_34]) ).
cnf(c_0_38,plain,
( in(esk2_4(X1,X2,X3,X4),X2)
| X3 != cartesian_product2(X1,X2)
| ~ in(X4,X3) ),
i_0_9 ).
cnf(c_0_39,plain,
( in(X1,cartesian_product2(esk10_0,esk11_0))
| ~ in(esk2_4(X2,X3,cartesian_product2(X2,X3),X1),esk9_0)
| ~ in(esk1_4(X2,X3,cartesian_product2(X2,X3),X1),esk8_0)
| ~ in(X1,cartesian_product2(X2,X3)) ),
inference(spm,[status(thm)],[c_0_36,c_0_37]) ).
cnf(c_0_40,plain,
( in(esk2_4(X1,X2,cartesian_product2(X1,X2),X3),X2)
| ~ in(X3,cartesian_product2(X1,X2)) ),
inference(er,[status(thm)],[c_0_38]) ).
cnf(c_0_41,plain,
( in(esk1_4(X1,X2,X3,X4),X1)
| X3 != cartesian_product2(X1,X2)
| ~ in(X4,X3) ),
i_0_10 ).
cnf(c_0_42,plain,
( in(X1,cartesian_product2(esk10_0,esk11_0))
| ~ in(esk1_4(X2,esk9_0,cartesian_product2(X2,esk9_0),X1),esk8_0)
| ~ in(X1,cartesian_product2(X2,esk9_0)) ),
inference(spm,[status(thm)],[c_0_39,c_0_40]) ).
cnf(c_0_43,plain,
( in(esk1_4(X1,X2,cartesian_product2(X1,X2),X3),X1)
| ~ in(X3,cartesian_product2(X1,X2)) ),
inference(er,[status(thm)],[c_0_41]) ).
cnf(c_0_44,negated_conjecture,
( in(unordered_pair(unordered_pair(X1,X2),singleton(X1)),cartesian_product2(esk8_0,esk9_0))
| ~ in(unordered_pair(unordered_pair(X1,X2),singleton(X1)),cartesian_product2(esk10_0,esk11_0)) ),
i_0_16 ).
cnf(c_0_45,plain,
( in(X1,cartesian_product2(esk10_0,esk11_0))
| ~ in(X1,cartesian_product2(esk8_0,esk9_0)) ),
inference(spm,[status(thm)],[c_0_42,c_0_43]) ).
cnf(c_0_46,plain,
( X1 = X2
| in(esk12_2(X1,X2),X2)
| in(esk12_2(X1,X2),X1) ),
i_0_18 ).
cnf(c_0_47,plain,
( in(unordered_pair(singleton(X1),unordered_pair(X1,X2)),cartesian_product2(esk8_0,esk9_0))
| ~ in(unordered_pair(singleton(X1),unordered_pair(X1,X2)),cartesian_product2(esk10_0,esk11_0)) ),
inference(spm,[status(thm)],[c_0_44,c_0_34]) ).
cnf(c_0_48,plain,
( X1 = cartesian_product2(esk8_0,esk9_0)
| in(esk12_2(X1,cartesian_product2(esk8_0,esk9_0)),cartesian_product2(esk10_0,esk11_0))
| in(esk12_2(X1,cartesian_product2(esk8_0,esk9_0)),X1) ),
inference(spm,[status(thm)],[c_0_45,c_0_46]) ).
cnf(c_0_49,negated_conjecture,
cartesian_product2(esk10_0,esk11_0) != cartesian_product2(esk8_0,esk9_0),
i_0_15 ).
cnf(c_0_50,plain,
( in(X1,cartesian_product2(esk8_0,esk9_0))
| ~ in(X1,cartesian_product2(esk10_0,esk11_0))
| ~ in(X1,cartesian_product2(X2,X3)) ),
inference(spm,[status(thm)],[c_0_47,c_0_37]) ).
cnf(c_0_51,plain,
in(esk12_2(cartesian_product2(esk10_0,esk11_0),cartesian_product2(esk8_0,esk9_0)),cartesian_product2(esk10_0,esk11_0)),
inference(sr,[status(thm)],[inference(ef,[status(thm)],[c_0_48]),c_0_49]) ).
cnf(c_0_52,plain,
( in(esk12_2(cartesian_product2(esk10_0,esk11_0),cartesian_product2(esk8_0,esk9_0)),cartesian_product2(esk8_0,esk9_0))
| ~ in(esk12_2(cartesian_product2(esk10_0,esk11_0),cartesian_product2(esk8_0,esk9_0)),cartesian_product2(X1,X2)) ),
inference(spm,[status(thm)],[c_0_50,c_0_51]) ).
cnf(c_0_53,plain,
( X1 = X2
| ~ in(esk12_2(X1,X2),X2)
| ~ in(esk12_2(X1,X2),X1) ),
i_0_19 ).
cnf(c_0_54,plain,
in(esk12_2(cartesian_product2(esk10_0,esk11_0),cartesian_product2(esk8_0,esk9_0)),cartesian_product2(esk8_0,esk9_0)),
inference(spm,[status(thm)],[c_0_52,c_0_51]) ).
cnf(c_0_55,plain,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_54]),c_0_51])]),c_0_49]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.18 % Problem : SET955+1 : TPTP v8.1.0. Bugfixed v4.0.0.
% 0.08/0.19 % Command : enigmatic-eprover.py %s %d 1
% 0.08/0.38 % Computer : n026.cluster.edu
% 0.08/0.38 % Model : x86_64 x86_64
% 0.08/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.38 % Memory : 8042.1875MB
% 0.08/0.38 % OS : Linux 3.10.0-693.el7.x86_64
% 0.08/0.38 % CPULimit : 300
% 0.08/0.38 % WCLimit : 600
% 0.08/0.38 % DateTime : Sun Jul 10 21:52:28 EDT 2022
% 0.08/0.38 % CPUTime :
% 0.12/0.50 # ENIGMATIC: Selected complete mode:
% 8.39/3.43 # ENIGMATIC: Solved by autoschedule:
% 8.39/3.43 # No SInE strategy applied
% 8.39/3.43 # Trying AutoSched0 for 150 seconds
% 8.39/3.43 # AutoSched0-Mode selected heuristic G_E___208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 8.39/3.43 # and selection function SelectComplexExceptUniqMaxHorn.
% 8.39/3.43 #
% 8.39/3.43 # Preprocessing time : 0.012 s
% 8.39/3.43 # Presaturation interreduction done
% 8.39/3.43
% 8.39/3.43 # Proof found!
% 8.39/3.43 # SZS status Theorem
% 8.39/3.43 # SZS output start CNFRefutation
% See solution above
% 8.39/3.43 # Training examples: 0 positive, 0 negative
% 8.39/3.43
% 8.39/3.43 # -------------------------------------------------
% 8.39/3.43 # User time : 0.020 s
% 8.39/3.43 # System time : 0.007 s
% 8.39/3.43 # Total time : 0.027 s
% 8.39/3.43 # Maximum resident set size: 7124 pages
% 8.39/3.43
%------------------------------------------------------------------------------