TSTP Solution File: SET985+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SET985+1 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n017.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.53s 2.42s
% Output : CNFRefutation 8.53s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 8
% Syntax : Number of clauses : 21 ( 10 unt; 11 nHn; 19 RR)
% Number of literals : 38 ( 16 equ; 10 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 5 con; 0-2 aty)
% Number of variables : 22 ( 6 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_9,plain,
( cartesian_product2(X1,X2) = empty_set
| subset(X1,X3)
| ~ subset(cartesian_product2(X1,X2),cartesian_product2(X3,X4)) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-4cqwd1ke/input.p',i_0_9) ).
cnf(i_0_11,negated_conjecture,
( subset(cartesian_product2(esk3_0,esk4_0),cartesian_product2(esk5_0,esk6_0))
| subset(cartesian_product2(esk4_0,esk3_0),cartesian_product2(esk6_0,esk5_0)) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-4cqwd1ke/input.p',i_0_11) ).
cnf(i_0_10,negated_conjecture,
~ subset(esk4_0,esk6_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-4cqwd1ke/input.p',i_0_10) ).
cnf(i_0_8,plain,
( cartesian_product2(X1,X2) = empty_set
| subset(X2,X3)
| ~ subset(cartesian_product2(X1,X2),cartesian_product2(X4,X3)) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-4cqwd1ke/input.p',i_0_8) ).
cnf(i_0_7,plain,
( X1 = empty_set
| X2 = empty_set
| cartesian_product2(X2,X1) != empty_set ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-4cqwd1ke/input.p',i_0_7) ).
cnf(i_0_13,plain,
subset(empty_set,X1),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-4cqwd1ke/input.p',i_0_13) ).
cnf(i_0_12,negated_conjecture,
~ empty(esk3_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-4cqwd1ke/input.p',i_0_12) ).
cnf(i_0_1,plain,
empty(empty_set),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-4cqwd1ke/input.p',i_0_1) ).
cnf(c_0_22,plain,
( cartesian_product2(X1,X2) = empty_set
| subset(X1,X3)
| ~ subset(cartesian_product2(X1,X2),cartesian_product2(X3,X4)) ),
i_0_9 ).
cnf(c_0_23,negated_conjecture,
( subset(cartesian_product2(esk3_0,esk4_0),cartesian_product2(esk5_0,esk6_0))
| subset(cartesian_product2(esk4_0,esk3_0),cartesian_product2(esk6_0,esk5_0)) ),
i_0_11 ).
cnf(c_0_24,negated_conjecture,
~ subset(esk4_0,esk6_0),
i_0_10 ).
cnf(c_0_25,plain,
( cartesian_product2(X1,X2) = empty_set
| subset(X2,X3)
| ~ subset(cartesian_product2(X1,X2),cartesian_product2(X4,X3)) ),
i_0_8 ).
cnf(c_0_26,negated_conjecture,
( cartesian_product2(esk4_0,esk3_0) = empty_set
| subset(cartesian_product2(esk3_0,esk4_0),cartesian_product2(esk5_0,esk6_0)) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_24]) ).
cnf(c_0_27,plain,
( X1 = empty_set
| X2 = empty_set
| cartesian_product2(X2,X1) != empty_set ),
i_0_7 ).
cnf(c_0_28,plain,
( cartesian_product2(esk4_0,esk3_0) = empty_set
| cartesian_product2(esk3_0,esk4_0) = empty_set ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_24]) ).
cnf(c_0_29,plain,
( esk3_0 = empty_set
| esk4_0 = empty_set ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_27]) ).
cnf(c_0_30,plain,
subset(empty_set,X1),
i_0_13 ).
cnf(c_0_31,negated_conjecture,
~ empty(esk3_0),
i_0_12 ).
cnf(c_0_32,negated_conjecture,
esk3_0 = empty_set,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_29]),c_0_30])]) ).
cnf(c_0_33,plain,
empty(empty_set),
i_0_1 ).
cnf(c_0_34,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_31,c_0_32]),c_0_33])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SET985+1 : TPTP v8.1.0. Released v3.2.0.
% 0.03/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.14/0.34 % Computer : n017.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 600
% 0.14/0.34 % DateTime : Mon Jul 11 05:45:50 EDT 2022
% 0.14/0.35 % CPUTime :
% 0.21/0.47 # ENIGMATIC: Selected complete mode:
% 8.53/2.42 # ENIGMATIC: Solved by autoschedule:
% 8.53/2.42 # No SInE strategy applied
% 8.53/2.42 # Trying AutoSched0 for 150 seconds
% 8.53/2.42 # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S08BI
% 8.53/2.42 # and selection function SelectCQPrecWNTNp.
% 8.53/2.42 #
% 8.53/2.42 # Preprocessing time : 0.023 s
% 8.53/2.42 # Presaturation interreduction done
% 8.53/2.42
% 8.53/2.42 # Proof found!
% 8.53/2.42 # SZS status Theorem
% 8.53/2.42 # SZS output start CNFRefutation
% See solution above
% 8.53/2.42 # Training examples: 0 positive, 0 negative
% 8.53/2.42
% 8.53/2.42 # -------------------------------------------------
% 8.53/2.42 # User time : 0.025 s
% 8.53/2.42 # System time : 0.007 s
% 8.53/2.42 # Total time : 0.031 s
% 8.53/2.42 # Maximum resident set size: 7116 pages
% 8.53/2.42
%------------------------------------------------------------------------------