TSTP Solution File: SET977+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SET977+1 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n015.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:38 EDT 2022
% Result : Theorem 7.52s 2.39s
% Output : CNFRefutation 7.52s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 6
% Syntax : Number of clauses : 19 ( 6 unt; 4 nHn; 15 RR)
% Number of literals : 36 ( 16 equ; 19 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 3 con; 0-2 aty)
% Number of variables : 31 ( 5 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_10,plain,
( in(unordered_pair(unordered_pair(X1,X2),singleton(X1)),cartesian_product2(singleton(X3),X4))
| X1 != X3
| ~ in(X2,X4) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ddv8ywwz/input.p',i_0_10) ).
cnf(i_0_4,plain,
( X1 != empty_set
| ~ in(X2,X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ddv8ywwz/input.p',i_0_4) ).
cnf(i_0_16,negated_conjecture,
( cartesian_product2(esk4_0,singleton(esk5_0)) = empty_set
| cartesian_product2(singleton(esk5_0),esk4_0) = empty_set ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ddv8ywwz/input.p',i_0_16) ).
cnf(i_0_13,plain,
( in(unordered_pair(unordered_pair(X1,X2),singleton(X1)),cartesian_product2(X3,singleton(X4)))
| X2 != X4
| ~ in(X1,X3) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ddv8ywwz/input.p',i_0_13) ).
cnf(i_0_3,plain,
( X1 = empty_set
| in(esk1_1(X1),X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ddv8ywwz/input.p',i_0_3) ).
cnf(i_0_17,negated_conjecture,
esk4_0 != empty_set,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-ddv8ywwz/input.p',i_0_17) ).
cnf(c_0_24,plain,
( in(unordered_pair(unordered_pair(X1,X2),singleton(X1)),cartesian_product2(singleton(X3),X4))
| X1 != X3
| ~ in(X2,X4) ),
i_0_10 ).
cnf(c_0_25,plain,
( X1 != empty_set
| ~ in(X2,X1) ),
i_0_4 ).
cnf(c_0_26,plain,
( in(unordered_pair(unordered_pair(X1,X2),singleton(X1)),cartesian_product2(singleton(X1),X3))
| ~ in(X2,X3) ),
inference(er,[status(thm)],[c_0_24]) ).
cnf(c_0_27,negated_conjecture,
( cartesian_product2(esk4_0,singleton(esk5_0)) = empty_set
| cartesian_product2(singleton(esk5_0),esk4_0) = empty_set ),
i_0_16 ).
cnf(c_0_28,plain,
~ in(X1,empty_set),
inference(er,[status(thm)],[c_0_25]) ).
cnf(c_0_29,plain,
( in(unordered_pair(unordered_pair(X1,X2),singleton(X1)),cartesian_product2(X3,singleton(X4)))
| X2 != X4
| ~ in(X1,X3) ),
i_0_13 ).
cnf(c_0_30,negated_conjecture,
( cartesian_product2(esk4_0,singleton(esk5_0)) = empty_set
| ~ in(X1,esk4_0) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_28]) ).
cnf(c_0_31,plain,
( X1 = empty_set
| in(esk1_1(X1),X1) ),
i_0_3 ).
cnf(c_0_32,negated_conjecture,
esk4_0 != empty_set,
i_0_17 ).
cnf(c_0_33,plain,
( in(unordered_pair(unordered_pair(X1,X2),singleton(X1)),cartesian_product2(X3,singleton(X2)))
| ~ in(X1,X3) ),
inference(er,[status(thm)],[c_0_29]) ).
cnf(c_0_34,plain,
cartesian_product2(esk4_0,singleton(esk5_0)) = empty_set,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_32]) ).
cnf(c_0_35,plain,
~ in(X1,esk4_0),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_28]) ).
cnf(c_0_36,plain,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_31]),c_0_32]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : SET977+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 : n015.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 22:51:09 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.19/0.45 # ENIGMATIC: Selected complete mode:
% 7.52/2.39 # ENIGMATIC: Solved by autoschedule:
% 7.52/2.39 # No SInE strategy applied
% 7.52/2.39 # Trying AutoSched0 for 150 seconds
% 7.52/2.39 # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S0Y_ni
% 7.52/2.39 # and selection function SelectMaxLComplexAvoidPosPred.
% 7.52/2.39 #
% 7.52/2.39 # Preprocessing time : 0.022 s
% 7.52/2.39 # Presaturation interreduction done
% 7.52/2.39
% 7.52/2.39 # Proof found!
% 7.52/2.39 # SZS status Theorem
% 7.52/2.39 # SZS output start CNFRefutation
% See solution above
% 7.52/2.39 # Training examples: 0 positive, 0 negative
% 7.52/2.39
% 7.52/2.39 # -------------------------------------------------
% 7.52/2.39 # User time : 0.021 s
% 7.52/2.39 # System time : 0.007 s
% 7.52/2.39 # Total time : 0.029 s
% 7.52/2.39 # Maximum resident set size: 7120 pages
% 7.52/2.39
%------------------------------------------------------------------------------