TSTP Solution File: SET950+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SET950+1 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n027.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:28 EDT 2022
% Result : Theorem 7.47s 2.40s
% Output : CNFRefutation 7.47s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 8
% Syntax : Number of clauses : 25 ( 8 unt; 0 nHn; 23 RR)
% Number of literals : 54 ( 14 equ; 35 neg)
% Maximal clause size : 3 ( 2 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 4 con; 0-4 aty)
% Number of variables : 53 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_19,negated_conjecture,
( unordered_pair(unordered_pair(X1,X2),singleton(X1)) != esk12_0
| ~ in(X2,esk11_0)
| ~ in(X1,esk10_0) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-dcn1xax8/lgb.p',i_0_19) ).
cnf(i_0_2,plain,
unordered_pair(X1,X2) = unordered_pair(X2,X1),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-dcn1xax8/lgb.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/sandbox2/tmp/enigma-theBenchmark.p-dcn1xax8/lgb.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/sandbox2/tmp/enigma-theBenchmark.p-dcn1xax8/lgb.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/sandbox2/tmp/enigma-theBenchmark.p-dcn1xax8/lgb.p',i_0_10) ).
cnf(i_0_13,plain,
( in(X1,X2)
| ~ in(X1,X3)
| ~ subset(X3,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-dcn1xax8/lgb.p',i_0_13) ).
cnf(i_0_21,negated_conjecture,
subset(esk9_0,cartesian_product2(esk10_0,esk11_0)),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-dcn1xax8/lgb.p',i_0_21) ).
cnf(i_0_20,negated_conjecture,
in(esk12_0,esk9_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-dcn1xax8/lgb.p',i_0_20) ).
cnf(c_0_30,negated_conjecture,
( unordered_pair(unordered_pair(X1,X2),singleton(X1)) != esk12_0
| ~ in(X2,esk11_0)
| ~ in(X1,esk10_0) ),
i_0_19 ).
cnf(c_0_31,plain,
unordered_pair(X1,X2) = unordered_pair(X2,X1),
i_0_2 ).
cnf(c_0_32,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_33,plain,
( unordered_pair(singleton(X1),unordered_pair(X1,X2)) != esk12_0
| ~ in(X2,esk11_0)
| ~ in(X1,esk10_0) ),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_34,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(er,[status(thm)],[inference(rw,[status(thm)],[c_0_32,c_0_31])]) ).
cnf(c_0_35,plain,
( in(esk2_4(X1,X2,X3,X4),X2)
| X3 != cartesian_product2(X1,X2)
| ~ in(X4,X3) ),
i_0_9 ).
cnf(c_0_36,plain,
( ~ in(esk2_4(X1,X2,cartesian_product2(X1,X2),esk12_0),esk11_0)
| ~ in(esk1_4(X1,X2,cartesian_product2(X1,X2),esk12_0),esk10_0)
| ~ in(esk12_0,cartesian_product2(X1,X2)) ),
inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34])]) ).
cnf(c_0_37,plain,
( in(esk2_4(X1,X2,cartesian_product2(X1,X2),X3),X2)
| ~ in(X3,cartesian_product2(X1,X2)) ),
inference(er,[status(thm)],[c_0_35]) ).
cnf(c_0_38,plain,
( in(esk1_4(X1,X2,X3,X4),X1)
| X3 != cartesian_product2(X1,X2)
| ~ in(X4,X3) ),
i_0_10 ).
cnf(c_0_39,plain,
( ~ in(esk1_4(X1,esk11_0,cartesian_product2(X1,esk11_0),esk12_0),esk10_0)
| ~ in(esk12_0,cartesian_product2(X1,esk11_0)) ),
inference(spm,[status(thm)],[c_0_36,c_0_37]) ).
cnf(c_0_40,plain,
( in(esk1_4(X1,X2,cartesian_product2(X1,X2),X3),X1)
| ~ in(X3,cartesian_product2(X1,X2)) ),
inference(er,[status(thm)],[c_0_38]) ).
cnf(c_0_41,plain,
( in(X1,X2)
| ~ in(X1,X3)
| ~ subset(X3,X2) ),
i_0_13 ).
cnf(c_0_42,negated_conjecture,
subset(esk9_0,cartesian_product2(esk10_0,esk11_0)),
i_0_21 ).
cnf(c_0_43,plain,
~ in(esk12_0,cartesian_product2(esk10_0,esk11_0)),
inference(spm,[status(thm)],[c_0_39,c_0_40]) ).
cnf(c_0_44,negated_conjecture,
( in(X1,cartesian_product2(esk10_0,esk11_0))
| ~ in(X1,esk9_0) ),
inference(spm,[status(thm)],[c_0_41,c_0_42]) ).
cnf(c_0_45,negated_conjecture,
in(esk12_0,esk9_0),
i_0_20 ).
cnf(c_0_46,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_44]),c_0_45])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : SET950+1 : TPTP v8.1.0. Released v3.2.0.
% 0.03/0.14 % Command : enigmatic-eprover.py %s %d 1
% 0.14/0.35 % Computer : n027.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 600
% 0.14/0.35 % DateTime : Sun Jul 10 03:28:19 EDT 2022
% 0.14/0.36 % CPUTime :
% 0.20/0.47 # ENIGMATIC: Selected complete mode:
% 7.47/2.40 # ENIGMATIC: Solved by autoschedule-lgb:
% 7.47/2.40 # No SInE strategy applied
% 7.47/2.40 # Trying AutoSched0 for 150 seconds
% 7.47/2.40 # AutoSched0-Mode selected heuristic G_____0003_C18_F1_SE_CS_SP_S0Y
% 7.47/2.40 # and selection function SelectMaxLComplexAvoidPosPred.
% 7.47/2.40 #
% 7.47/2.40 # Preprocessing time : 0.023 s
% 7.47/2.40
% 7.47/2.40 # Proof found!
% 7.47/2.40 # SZS status Theorem
% 7.47/2.40 # SZS output start CNFRefutation
% See solution above
% 7.47/2.40 # Training examples: 0 positive, 0 negative
% 7.47/2.40
% 7.47/2.40 # -------------------------------------------------
% 7.47/2.40 # User time : 0.024 s
% 7.47/2.40 # System time : 0.006 s
% 7.47/2.40 # Total time : 0.031 s
% 7.47/2.40 # Maximum resident set size: 7124 pages
% 7.47/2.40
%------------------------------------------------------------------------------