TSTP Solution File: SET978+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SET978+1 : TPTP v8.1.0. Released v3.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:15:39 EDT 2022
% Result : Theorem 4.34s 2.10s
% Output : CNFRefutation 4.34s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 5
% Syntax : Number of clauses : 12 ( 4 unt; 2 nHn; 6 RR)
% Number of literals : 20 ( 4 equ; 11 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 4 con; 0-2 aty)
% Number of variables : 20 ( 8 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_6,negated_conjecture,
( ~ disjoint(cartesian_product2(esk5_0,singleton(esk3_0)),cartesian_product2(esk6_0,singleton(esk4_0)))
| ~ disjoint(cartesian_product2(singleton(esk3_0),esk5_0),cartesian_product2(singleton(esk4_0),esk6_0)) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-j9gzalz_/input.p',i_0_6) ).
cnf(i_0_5,plain,
( disjoint(cartesian_product2(X1,X2),cartesian_product2(X3,X4))
| ~ disjoint(X1,X3) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-j9gzalz_/input.p',i_0_5) ).
cnf(i_0_4,plain,
( disjoint(cartesian_product2(X1,X2),cartesian_product2(X3,X4))
| ~ disjoint(X2,X4) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-j9gzalz_/input.p',i_0_4) ).
cnf(i_0_8,plain,
( X1 = X2
| disjoint(singleton(X1),singleton(X2)) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-j9gzalz_/input.p',i_0_8) ).
cnf(i_0_7,negated_conjecture,
esk3_0 != esk4_0,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-j9gzalz_/input.p',i_0_7) ).
cnf(c_0_14,negated_conjecture,
( ~ disjoint(cartesian_product2(esk5_0,singleton(esk3_0)),cartesian_product2(esk6_0,singleton(esk4_0)))
| ~ disjoint(cartesian_product2(singleton(esk3_0),esk5_0),cartesian_product2(singleton(esk4_0),esk6_0)) ),
i_0_6 ).
cnf(c_0_15,plain,
( disjoint(cartesian_product2(X1,X2),cartesian_product2(X3,X4))
| ~ disjoint(X1,X3) ),
i_0_5 ).
cnf(c_0_16,plain,
( disjoint(cartesian_product2(X1,X2),cartesian_product2(X3,X4))
| ~ disjoint(X2,X4) ),
i_0_4 ).
cnf(c_0_17,plain,
~ disjoint(singleton(esk3_0),singleton(esk4_0)),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_16]) ).
cnf(c_0_18,plain,
( X1 = X2
| disjoint(singleton(X1),singleton(X2)) ),
i_0_8 ).
cnf(c_0_19,negated_conjecture,
esk3_0 != esk4_0,
i_0_7 ).
cnf(c_0_20,plain,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_19]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SET978+1 : TPTP v8.1.0. Released v3.2.0.
% 0.07/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 : Sat Jul 9 15:45:33 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.18/0.45 # ENIGMATIC: Selected complete mode:
% 4.34/2.10 # ENIGMATIC: Solved by autoschedule:
% 4.34/2.10 # No SInE strategy applied
% 4.34/2.10 # Trying AutoSched0 for 150 seconds
% 4.34/2.10 # AutoSched0-Mode selected heuristic G_____0010_evo
% 4.34/2.10 # and selection function SelectMaxLComplexAvoidPosPred.
% 4.34/2.10 #
% 4.34/2.10 # Preprocessing time : 0.023 s
% 4.34/2.10
% 4.34/2.10 # Proof found!
% 4.34/2.10 # SZS status Theorem
% 4.34/2.10 # SZS output start CNFRefutation
% See solution above
% 4.34/2.10 # Training examples: 0 positive, 0 negative
% 4.34/2.10
% 4.34/2.10 # -------------------------------------------------
% 4.34/2.10 # User time : 0.024 s
% 4.34/2.10 # System time : 0.005 s
% 4.34/2.10 # Total time : 0.029 s
% 4.34/2.10 # Maximum resident set size: 7120 pages
% 4.34/2.10
%------------------------------------------------------------------------------