TSTP Solution File: SET662+3 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SET662+3 : TPTP v8.1.0. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n007.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:13:16 EDT 2022
% Result : Theorem 6.64s 2.24s
% Output : CNFRefutation 6.64s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 8
% Syntax : Number of clauses : 26 ( 8 unt; 5 nHn; 22 RR)
% Number of literals : 66 ( 0 equ; 44 neg)
% Maximal clause size : 5 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 4 con; 0-2 aty)
% Number of variables : 41 ( 5 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_19,plain,
( ~ empty(X1)
| ~ member(X2,X1)
| ~ ilf_type(X2,set_type)
| ~ ilf_type(X1,set_type) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ykk_1jnk/input.p',i_0_19) ).
cnf(i_0_38,plain,
ilf_type(X1,set_type),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ykk_1jnk/input.p',i_0_38) ).
cnf(i_0_3,plain,
( ilf_type(X1,relation_type(X2,X3))
| ~ ilf_type(X3,set_type)
| ~ ilf_type(X2,set_type)
| ~ ilf_type(X1,subset_type(cross_product(X2,X3))) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ykk_1jnk/input.p',i_0_3) ).
cnf(i_0_9,plain,
( ilf_type(X1,subset_type(X2))
| ~ ilf_type(X2,set_type)
| ~ ilf_type(X1,set_type)
| ~ ilf_type(X1,member_type(power_set(X2))) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ykk_1jnk/input.p',i_0_9) ).
cnf(i_0_26,plain,
( empty(X1)
| ilf_type(X2,member_type(X1))
| ~ member(X2,X1)
| ~ ilf_type(X1,set_type)
| ~ ilf_type(X2,set_type) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ykk_1jnk/input.p',i_0_26) ).
cnf(i_0_5,plain,
( ~ ilf_type(X1,set_type)
| ~ member(X1,empty_set) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ykk_1jnk/input.p',i_0_5) ).
cnf(i_0_21,plain,
( member(X1,power_set(X2))
| member(esk5_2(X1,X2),X1)
| ~ ilf_type(X2,set_type)
| ~ ilf_type(X1,set_type) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ykk_1jnk/input.p',i_0_21) ).
cnf(i_0_39,negated_conjecture,
~ ilf_type(empty_set,relation_type(esk10_0,esk11_0)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ykk_1jnk/input.p',i_0_39) ).
cnf(c_0_48,plain,
( ~ empty(X1)
| ~ member(X2,X1)
| ~ ilf_type(X2,set_type)
| ~ ilf_type(X1,set_type) ),
i_0_19 ).
cnf(c_0_49,plain,
ilf_type(X1,set_type),
i_0_38 ).
cnf(c_0_50,plain,
( ilf_type(X1,relation_type(X2,X3))
| ~ ilf_type(X3,set_type)
| ~ ilf_type(X2,set_type)
| ~ ilf_type(X1,subset_type(cross_product(X2,X3))) ),
i_0_3 ).
cnf(c_0_51,plain,
( ilf_type(X1,subset_type(X2))
| ~ ilf_type(X2,set_type)
| ~ ilf_type(X1,set_type)
| ~ ilf_type(X1,member_type(power_set(X2))) ),
i_0_9 ).
cnf(c_0_52,plain,
( empty(X1)
| ilf_type(X2,member_type(X1))
| ~ member(X2,X1)
| ~ ilf_type(X1,set_type)
| ~ ilf_type(X2,set_type) ),
i_0_26 ).
cnf(c_0_53,plain,
( ~ member(X1,X2)
| ~ empty(X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_48,c_0_49]),c_0_49])]) ).
cnf(c_0_54,plain,
( ~ ilf_type(X1,set_type)
| ~ member(X1,empty_set) ),
i_0_5 ).
cnf(c_0_55,plain,
( member(X1,power_set(X2))
| member(esk5_2(X1,X2),X1)
| ~ ilf_type(X2,set_type)
| ~ ilf_type(X1,set_type) ),
i_0_21 ).
cnf(c_0_56,negated_conjecture,
~ ilf_type(empty_set,relation_type(esk10_0,esk11_0)),
i_0_39 ).
cnf(c_0_57,plain,
( ilf_type(X1,relation_type(X2,X3))
| ~ ilf_type(X1,subset_type(cross_product(X2,X3))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_50,c_0_49]),c_0_49])]) ).
cnf(c_0_58,plain,
( ilf_type(X1,subset_type(X2))
| ~ ilf_type(X1,member_type(power_set(X2))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_51,c_0_49]),c_0_49])]) ).
cnf(c_0_59,plain,
( ilf_type(X1,member_type(X2))
| ~ member(X1,X2) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_52,c_0_49]),c_0_49])]),c_0_53]) ).
cnf(c_0_60,plain,
~ member(X1,empty_set),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_54,c_0_49])]) ).
cnf(c_0_61,plain,
( member(esk5_2(X1,X2),X1)
| member(X1,power_set(X2)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_55,c_0_49]),c_0_49])]) ).
cnf(c_0_62,negated_conjecture,
~ ilf_type(empty_set,subset_type(cross_product(esk10_0,esk11_0))),
inference(spm,[status(thm)],[c_0_56,c_0_57]) ).
cnf(c_0_63,plain,
( ilf_type(X1,subset_type(X2))
| ~ member(X1,power_set(X2)) ),
inference(spm,[status(thm)],[c_0_58,c_0_59]) ).
cnf(c_0_64,plain,
member(empty_set,power_set(X1)),
inference(spm,[status(thm)],[c_0_60,c_0_61]) ).
cnf(c_0_65,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_62,c_0_63]),c_0_64])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : SET662+3 : TPTP v8.1.0. Released v2.2.0.
% 0.06/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n007.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 03:23:03 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.19/0.44 # ENIGMATIC: Selected complete mode:
% 6.64/2.24 # ENIGMATIC: Solved by autoschedule:
% 6.64/2.24 # No SInE strategy applied
% 6.64/2.24 # Trying AutoSched0 for 150 seconds
% 6.64/2.24 # AutoSched0-Mode selected heuristic G_E___107_B42_F1_PI_SE_Q4_CS_SP_PS_S0Y
% 6.64/2.24 # and selection function SelectMaxLComplexAvoidPosPred.
% 6.64/2.24 #
% 6.64/2.24 # Preprocessing time : 0.016 s
% 6.64/2.24 # Presaturation interreduction done
% 6.64/2.24
% 6.64/2.24 # Proof found!
% 6.64/2.24 # SZS status Theorem
% 6.64/2.24 # SZS output start CNFRefutation
% See solution above
% 6.64/2.24 # Training examples: 0 positive, 0 negative
% 6.64/2.24
% 6.64/2.24 # -------------------------------------------------
% 6.64/2.24 # User time : 0.017 s
% 6.64/2.24 # System time : 0.006 s
% 6.64/2.24 # Total time : 0.023 s
% 6.64/2.24 # Maximum resident set size: 7124 pages
% 6.64/2.24
%------------------------------------------------------------------------------