TSTP Solution File: SET984+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SET984+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:41 EDT 2022
% Result : Theorem 8.15s 2.46s
% Output : CNFRefutation 8.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 11
% Syntax : Number of clauses : 36 ( 16 unt; 12 nHn; 22 RR)
% Number of literals : 72 ( 59 equ; 18 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; 5 con; 0-2 aty)
% Number of variables : 52 ( 14 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_17,plain,
( set_intersection2(X1,X2) = X1
| ~ subset(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-jsh8pq59/input.p',i_0_17) ).
cnf(i_0_15,negated_conjecture,
subset(cartesian_product2(esk3_0,esk4_0),cartesian_product2(esk5_0,esk6_0)),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-jsh8pq59/input.p',i_0_15) ).
cnf(i_0_10,plain,
cartesian_product2(set_intersection2(X1,X2),set_intersection2(X3,X4)) = set_intersection2(cartesian_product2(X1,X3),cartesian_product2(X2,X4)),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-jsh8pq59/input.p',i_0_10) ).
cnf(i_0_1,plain,
set_intersection2(X1,X2) = set_intersection2(X2,X1),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-jsh8pq59/input.p',i_0_1) ).
cnf(i_0_12,plain,
( X1 = X2
| X3 = empty_set
| X1 = empty_set
| cartesian_product2(X1,X3) != cartesian_product2(X2,X4) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-jsh8pq59/input.p',i_0_12) ).
cnf(i_0_11,plain,
( X1 = X2
| X3 = empty_set
| X1 = empty_set
| cartesian_product2(X3,X1) != cartesian_product2(X4,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-jsh8pq59/input.p',i_0_11) ).
cnf(i_0_16,plain,
subset(set_intersection2(X1,X2),X1),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-jsh8pq59/input.p',i_0_16) ).
cnf(i_0_7,plain,
( cartesian_product2(X1,X2) = empty_set
| X2 != empty_set ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-jsh8pq59/input.p',i_0_7) ).
cnf(i_0_13,negated_conjecture,
( ~ subset(esk3_0,esk5_0)
| ~ subset(esk4_0,esk6_0) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-jsh8pq59/input.p',i_0_13) ).
cnf(i_0_8,plain,
( cartesian_product2(X1,X2) = empty_set
| X1 != empty_set ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-jsh8pq59/input.p',i_0_8) ).
cnf(i_0_14,negated_conjecture,
cartesian_product2(esk3_0,esk4_0) != empty_set,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-jsh8pq59/input.p',i_0_14) ).
cnf(c_0_29,plain,
( set_intersection2(X1,X2) = X1
| ~ subset(X1,X2) ),
i_0_17 ).
cnf(c_0_30,negated_conjecture,
subset(cartesian_product2(esk3_0,esk4_0),cartesian_product2(esk5_0,esk6_0)),
i_0_15 ).
cnf(c_0_31,plain,
cartesian_product2(set_intersection2(X1,X2),set_intersection2(X3,X4)) = set_intersection2(cartesian_product2(X1,X3),cartesian_product2(X2,X4)),
i_0_10 ).
cnf(c_0_32,plain,
set_intersection2(X1,X2) = set_intersection2(X2,X1),
i_0_1 ).
cnf(c_0_33,plain,
( X1 = X2
| X3 = empty_set
| X1 = empty_set
| cartesian_product2(X1,X3) != cartesian_product2(X2,X4) ),
i_0_12 ).
cnf(c_0_34,plain,
cartesian_product2(set_intersection2(esk5_0,esk3_0),set_intersection2(esk6_0,esk4_0)) = cartesian_product2(esk3_0,esk4_0),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_31]),c_0_32]),c_0_32]) ).
cnf(c_0_35,plain,
( X1 = X2
| X3 = empty_set
| X1 = empty_set
| cartesian_product2(X3,X1) != cartesian_product2(X4,X2) ),
i_0_11 ).
cnf(c_0_36,plain,
( X1 = set_intersection2(esk5_0,esk3_0)
| X2 = empty_set
| X1 = empty_set
| cartesian_product2(X1,X2) != cartesian_product2(esk3_0,esk4_0) ),
inference(spm,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_37,plain,
( X1 = set_intersection2(esk6_0,esk4_0)
| X2 = empty_set
| X1 = empty_set
| cartesian_product2(X2,X1) != cartesian_product2(esk3_0,esk4_0) ),
inference(spm,[status(thm)],[c_0_35,c_0_34]) ).
cnf(c_0_38,plain,
subset(set_intersection2(X1,X2),X1),
i_0_16 ).
cnf(c_0_39,plain,
( set_intersection2(esk5_0,esk3_0) = esk3_0
| empty_set = esk3_0
| empty_set = esk4_0 ),
inference(er,[status(thm)],[c_0_36]) ).
cnf(c_0_40,plain,
( set_intersection2(esk6_0,esk4_0) = esk4_0
| empty_set = esk4_0
| empty_set = esk3_0 ),
inference(er,[status(thm)],[c_0_37]) ).
cnf(c_0_41,plain,
( cartesian_product2(X1,X2) = empty_set
| X2 != empty_set ),
i_0_7 ).
cnf(c_0_42,negated_conjecture,
( ~ subset(esk3_0,esk5_0)
| ~ subset(esk4_0,esk6_0) ),
i_0_13 ).
cnf(c_0_43,plain,
( empty_set = esk4_0
| empty_set = esk3_0
| subset(esk3_0,esk5_0) ),
inference(spm,[status(thm)],[c_0_38,c_0_39]) ).
cnf(c_0_44,plain,
( empty_set = esk3_0
| empty_set = esk4_0
| subset(esk4_0,esk6_0) ),
inference(spm,[status(thm)],[c_0_38,c_0_40]) ).
cnf(c_0_45,plain,
cartesian_product2(X1,empty_set) = empty_set,
inference(er,[status(thm)],[c_0_41]) ).
cnf(c_0_46,negated_conjecture,
( empty_set = esk3_0
| empty_set = esk4_0 ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_43]),c_0_44]) ).
cnf(c_0_47,plain,
( cartesian_product2(X1,X2) = empty_set
| X1 != empty_set ),
i_0_8 ).
cnf(c_0_48,negated_conjecture,
cartesian_product2(esk3_0,esk4_0) != empty_set,
i_0_14 ).
cnf(c_0_49,plain,
( cartesian_product2(X1,esk4_0) = esk4_0
| empty_set = esk3_0 ),
inference(spm,[status(thm)],[c_0_45,c_0_46]) ).
cnf(c_0_50,plain,
cartesian_product2(empty_set,X1) = empty_set,
inference(er,[status(thm)],[c_0_47]) ).
cnf(c_0_51,negated_conjecture,
empty_set = esk3_0,
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_49]),c_0_46]) ).
cnf(c_0_52,plain,
cartesian_product2(esk3_0,X1) = esk3_0,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_50,c_0_51]),c_0_51]) ).
cnf(c_0_53,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_48,c_0_51]),c_0_52])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : SET984+1 : TPTP v8.1.0. Released v3.2.0.
% 0.00/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.11/0.33 % Computer : n025.cluster.edu
% 0.11/0.33 % Model : x86_64 x86_64
% 0.11/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.33 % Memory : 8042.1875MB
% 0.11/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33 % CPULimit : 300
% 0.11/0.33 % WCLimit : 600
% 0.11/0.33 % DateTime : Sun Jul 10 06:46:03 EDT 2022
% 0.11/0.33 % CPUTime :
% 0.18/0.43 # ENIGMATIC: Selected complete mode:
% 8.15/2.46 # ENIGMATIC: Solved by autoschedule:
% 8.15/2.46 # No SInE strategy applied
% 8.15/2.46 # Trying AutoSched0 for 150 seconds
% 8.15/2.46 # AutoSched0-Mode selected heuristic G_E___024_B31_F1_PI_AE_Q4_CS_SP_S2S
% 8.15/2.46 # and selection function SelectNewComplexAHP.
% 8.15/2.46 #
% 8.15/2.46 # Preprocessing time : 0.023 s
% 8.15/2.46
% 8.15/2.46 # Proof found!
% 8.15/2.46 # SZS status Theorem
% 8.15/2.46 # SZS output start CNFRefutation
% See solution above
% 8.15/2.46 # Training examples: 0 positive, 0 negative
% 8.15/2.46
% 8.15/2.46 # -------------------------------------------------
% 8.15/2.46 # User time : 0.025 s
% 8.15/2.46 # System time : 0.006 s
% 8.15/2.46 # Total time : 0.031 s
% 8.15/2.46 # Maximum resident set size: 7116 pages
% 8.15/2.46
%------------------------------------------------------------------------------