TSTP Solution File: SET964+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SET964+1 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n025.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:33 EDT 2022
% Result : Theorem 7.12s 2.25s
% Output : CNFRefutation 7.12s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 11
% Syntax : Number of clauses : 36 ( 8 unt; 11 nHn; 29 RR)
% Number of literals : 77 ( 6 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 : 9 ( 9 usr; 4 con; 0-2 aty)
% Number of variables : 66 ( 9 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_15,plain,
( in(X1,X2)
| ~ in(X1,X3)
| ~ subset(X3,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-pr084dwa/lgb.p',i_0_15) ).
cnf(i_0_26,negated_conjecture,
( subset(cartesian_product2(esk10_0,esk11_0),cartesian_product2(esk10_0,esk12_0))
| subset(cartesian_product2(esk11_0,esk10_0),cartesian_product2(esk12_0,esk10_0)) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-pr084dwa/lgb.p',i_0_26) ).
cnf(i_0_19,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-pr084dwa/lgb.p',i_0_19) ).
cnf(i_0_21,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-pr084dwa/lgb.p',i_0_21) ).
cnf(i_0_3,plain,
( X1 = empty_set
| in(esk1_1(X1),X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-pr084dwa/lgb.p',i_0_3) ).
cnf(i_0_27,negated_conjecture,
esk10_0 != empty_set,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-pr084dwa/lgb.p',i_0_27) ).
cnf(i_0_14,plain,
( subset(X1,X2)
| in(esk7_2(X1,X2),X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-pr084dwa/lgb.p',i_0_14) ).
cnf(i_0_13,plain,
( subset(X1,X2)
| ~ in(esk7_2(X1,X2),X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-pr084dwa/lgb.p',i_0_13) ).
cnf(i_0_25,negated_conjecture,
~ subset(esk11_0,esk12_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-pr084dwa/lgb.p',i_0_25) ).
cnf(i_0_20,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-pr084dwa/lgb.p',i_0_20) ).
cnf(i_0_2,plain,
unordered_pair(X1,X2) = unordered_pair(X2,X1),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-pr084dwa/lgb.p',i_0_2) ).
cnf(c_0_39,plain,
( in(X1,X2)
| ~ in(X1,X3)
| ~ subset(X3,X2) ),
i_0_15 ).
cnf(c_0_40,negated_conjecture,
( subset(cartesian_product2(esk10_0,esk11_0),cartesian_product2(esk10_0,esk12_0))
| subset(cartesian_product2(esk11_0,esk10_0),cartesian_product2(esk12_0,esk10_0)) ),
i_0_26 ).
cnf(c_0_41,negated_conjecture,
( in(X1,cartesian_product2(esk12_0,esk10_0))
| subset(cartesian_product2(esk10_0,esk11_0),cartesian_product2(esk10_0,esk12_0))
| ~ in(X1,cartesian_product2(esk11_0,esk10_0)) ),
inference(spm,[status(thm)],[c_0_39,c_0_40]) ).
cnf(c_0_42,plain,
( in(unordered_pair(unordered_pair(X1,X2),singleton(X1)),cartesian_product2(X3,X4))
| ~ in(X2,X4)
| ~ in(X1,X3) ),
i_0_19 ).
cnf(c_0_43,plain,
( in(X1,X2)
| ~ in(unordered_pair(unordered_pair(X1,X3),singleton(X1)),cartesian_product2(X2,X4)) ),
i_0_21 ).
cnf(c_0_44,negated_conjecture,
( in(unordered_pair(unordered_pair(X1,X2),singleton(X1)),cartesian_product2(esk12_0,esk10_0))
| subset(cartesian_product2(esk10_0,esk11_0),cartesian_product2(esk10_0,esk12_0))
| ~ in(X2,esk10_0)
| ~ in(X1,esk11_0) ),
inference(spm,[status(thm)],[c_0_41,c_0_42]) ).
cnf(c_0_45,plain,
( in(X1,esk12_0)
| subset(cartesian_product2(esk10_0,esk11_0),cartesian_product2(esk10_0,esk12_0))
| ~ in(X2,esk10_0)
| ~ in(X1,esk11_0) ),
inference(spm,[status(thm)],[c_0_43,c_0_44]) ).
cnf(c_0_46,plain,
( X1 = empty_set
| in(esk1_1(X1),X1) ),
i_0_3 ).
cnf(c_0_47,negated_conjecture,
esk10_0 != empty_set,
i_0_27 ).
cnf(c_0_48,plain,
( in(X1,esk12_0)
| subset(cartesian_product2(esk10_0,esk11_0),cartesian_product2(esk10_0,esk12_0))
| ~ in(X1,esk11_0) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_46]),c_0_47]) ).
cnf(c_0_49,plain,
( subset(X1,X2)
| in(esk7_2(X1,X2),X1) ),
i_0_14 ).
cnf(c_0_50,plain,
( subset(X1,X2)
| ~ in(esk7_2(X1,X2),X2) ),
i_0_13 ).
cnf(c_0_51,plain,
( in(esk7_2(esk11_0,X1),esk12_0)
| subset(cartesian_product2(esk10_0,esk11_0),cartesian_product2(esk10_0,esk12_0))
| subset(esk11_0,X1) ),
inference(spm,[status(thm)],[c_0_48,c_0_49]) ).
cnf(c_0_52,negated_conjecture,
~ subset(esk11_0,esk12_0),
i_0_25 ).
cnf(c_0_53,plain,
( in(X1,X2)
| ~ in(unordered_pair(unordered_pair(X3,X1),singleton(X3)),cartesian_product2(X4,X2)) ),
i_0_20 ).
cnf(c_0_54,plain,
unordered_pair(X1,X2) = unordered_pair(X2,X1),
i_0_2 ).
cnf(c_0_55,plain,
subset(cartesian_product2(esk10_0,esk11_0),cartesian_product2(esk10_0,esk12_0)),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_51]),c_0_52]) ).
cnf(c_0_56,plain,
( in(X1,X2)
| ~ in(unordered_pair(singleton(X3),unordered_pair(X3,X1)),cartesian_product2(X4,X2)) ),
inference(spm,[status(thm)],[c_0_53,c_0_54]) ).
cnf(c_0_57,plain,
( in(X1,cartesian_product2(esk10_0,esk12_0))
| ~ in(X1,cartesian_product2(esk10_0,esk11_0)) ),
inference(spm,[status(thm)],[c_0_39,c_0_55]) ).
cnf(c_0_58,plain,
( in(X1,esk12_0)
| ~ in(unordered_pair(singleton(X2),unordered_pair(X2,X1)),cartesian_product2(esk10_0,esk11_0)) ),
inference(spm,[status(thm)],[c_0_56,c_0_57]) ).
cnf(c_0_59,plain,
( in(unordered_pair(singleton(X1),unordered_pair(X1,X2)),cartesian_product2(X3,X4))
| ~ in(X2,X4)
| ~ in(X1,X3) ),
inference(spm,[status(thm)],[c_0_42,c_0_54]) ).
cnf(c_0_60,plain,
( in(X1,esk12_0)
| ~ in(X1,esk11_0)
| ~ in(X2,esk10_0) ),
inference(spm,[status(thm)],[c_0_58,c_0_59]) ).
cnf(c_0_61,plain,
( in(X1,esk12_0)
| ~ in(X1,esk11_0) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_60,c_0_46]),c_0_47]) ).
cnf(c_0_62,plain,
( subset(X1,esk12_0)
| ~ in(esk7_2(X1,esk12_0),esk11_0) ),
inference(spm,[status(thm)],[c_0_50,c_0_61]) ).
cnf(c_0_63,plain,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_62,c_0_49]),c_0_52]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : SET964+1 : TPTP v8.1.0. Released v3.2.0.
% 0.06/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n025.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 08:33:48 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.18/0.44 # ENIGMATIC: Selected complete mode:
% 7.12/2.25 # ENIGMATIC: Solved by autoschedule-lgb:
% 7.12/2.25 # No SInE strategy applied
% 7.12/2.25 # Trying AutoSched0 for 150 seconds
% 7.12/2.25 # AutoSched0-Mode selected heuristic G_E___300_C18_F1_SE_CS_SP_S0Y
% 7.12/2.25 # and selection function SelectMaxLComplexAvoidPosPred.
% 7.12/2.25 #
% 7.12/2.25 # Preprocessing time : 0.014 s
% 7.12/2.25
% 7.12/2.25 # Proof found!
% 7.12/2.25 # SZS status Theorem
% 7.12/2.25 # SZS output start CNFRefutation
% See solution above
% 7.12/2.25 # Training examples: 0 positive, 0 negative
% 7.12/2.25
% 7.12/2.25 # -------------------------------------------------
% 7.12/2.25 # User time : 0.017 s
% 7.12/2.25 # System time : 0.008 s
% 7.12/2.25 # Total time : 0.025 s
% 7.12/2.25 # Maximum resident set size: 7124 pages
% 7.12/2.25
%------------------------------------------------------------------------------