TSTP Solution File: SEU165+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SEU165+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n014.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 08:39:04 EDT 2022
% Result : Theorem 7.25s 2.36s
% Output : CNFRefutation 7.25s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 6
% Syntax : Number of clauses : 17 ( 4 unt; 4 nHn; 17 RR)
% Number of literals : 34 ( 0 equ; 17 neg)
% Maximal clause size : 3 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 4 con; 0-2 aty)
% Number of variables : 24 ( 6 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_15,plain,
( in(X1,X2)
| ~ in(unordered_pair(unordered_pair(X3,X1),singleton(X3)),cartesian_product2(X4,X2)) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-mrd7ln6y/input.p',i_0_15) ).
cnf(i_0_11,negated_conjecture,
( in(esk4_0,esk6_0)
| in(unordered_pair(unordered_pair(esk3_0,esk4_0),singleton(esk3_0)),cartesian_product2(esk5_0,esk6_0)) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-mrd7ln6y/input.p',i_0_11) ).
cnf(i_0_13,negated_conjecture,
( ~ in(esk3_0,esk5_0)
| ~ in(esk4_0,esk6_0)
| ~ in(unordered_pair(unordered_pair(esk3_0,esk4_0),singleton(esk3_0)),cartesian_product2(esk5_0,esk6_0)) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-mrd7ln6y/input.p',i_0_13) ).
cnf(i_0_16,plain,
( in(X1,X2)
| ~ in(unordered_pair(unordered_pair(X1,X3),singleton(X1)),cartesian_product2(X2,X4)) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-mrd7ln6y/input.p',i_0_16) ).
cnf(i_0_12,negated_conjecture,
( in(esk3_0,esk5_0)
| in(unordered_pair(unordered_pair(esk3_0,esk4_0),singleton(esk3_0)),cartesian_product2(esk5_0,esk6_0)) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-mrd7ln6y/input.p',i_0_12) ).
cnf(i_0_14,plain,
( in(unordered_pair(unordered_pair(X1,X2),singleton(X1)),cartesian_product2(X3,X4))
| ~ in(X2,X4)
| ~ in(X1,X3) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-mrd7ln6y/input.p',i_0_14) ).
cnf(c_0_23,plain,
( in(X1,X2)
| ~ in(unordered_pair(unordered_pair(X3,X1),singleton(X3)),cartesian_product2(X4,X2)) ),
i_0_15 ).
cnf(c_0_24,negated_conjecture,
( in(esk4_0,esk6_0)
| in(unordered_pair(unordered_pair(esk3_0,esk4_0),singleton(esk3_0)),cartesian_product2(esk5_0,esk6_0)) ),
i_0_11 ).
cnf(c_0_25,negated_conjecture,
( ~ in(esk3_0,esk5_0)
| ~ in(esk4_0,esk6_0)
| ~ in(unordered_pair(unordered_pair(esk3_0,esk4_0),singleton(esk3_0)),cartesian_product2(esk5_0,esk6_0)) ),
i_0_13 ).
cnf(c_0_26,negated_conjecture,
in(esk4_0,esk6_0),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_27,plain,
( in(X1,X2)
| ~ in(unordered_pair(unordered_pair(X1,X3),singleton(X1)),cartesian_product2(X2,X4)) ),
i_0_16 ).
cnf(c_0_28,negated_conjecture,
( in(esk3_0,esk5_0)
| in(unordered_pair(unordered_pair(esk3_0,esk4_0),singleton(esk3_0)),cartesian_product2(esk5_0,esk6_0)) ),
i_0_12 ).
cnf(c_0_29,negated_conjecture,
( ~ in(unordered_pair(unordered_pair(esk3_0,esk4_0),singleton(esk3_0)),cartesian_product2(esk5_0,esk6_0))
| ~ in(esk3_0,esk5_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_25,c_0_26])]) ).
cnf(c_0_30,negated_conjecture,
in(esk3_0,esk5_0),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_31,negated_conjecture,
~ in(unordered_pair(unordered_pair(esk3_0,esk4_0),singleton(esk3_0)),cartesian_product2(esk5_0,esk6_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_29,c_0_30])]) ).
cnf(c_0_32,plain,
( in(unordered_pair(unordered_pair(X1,X2),singleton(X1)),cartesian_product2(X3,X4))
| ~ in(X2,X4)
| ~ in(X1,X3) ),
i_0_14 ).
cnf(c_0_33,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_26]),c_0_30])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SEU165+1 : TPTP v8.1.0. Released v3.3.0.
% 0.03/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n014.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 : Mon Jun 20 08:26:19 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.20/0.45 # ENIGMATIC: Selected complete mode:
% 7.25/2.36 # ENIGMATIC: Solved by autoschedule:
% 7.25/2.36 # No SInE strategy applied
% 7.25/2.36 # Trying AutoSched0 for 150 seconds
% 7.25/2.36 # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S0Y_ni
% 7.25/2.36 # and selection function SelectMaxLComplexAvoidPosPred.
% 7.25/2.36 #
% 7.25/2.36 # Preprocessing time : 0.021 s
% 7.25/2.36 # Presaturation interreduction done
% 7.25/2.36
% 7.25/2.36 # Proof found!
% 7.25/2.36 # SZS status Theorem
% 7.25/2.36 # SZS output start CNFRefutation
% See solution above
% 7.25/2.36 # Training examples: 0 positive, 0 negative
% 7.25/2.36
% 7.25/2.36 # -------------------------------------------------
% 7.25/2.36 # User time : 0.023 s
% 7.25/2.36 # System time : 0.005 s
% 7.25/2.36 # Total time : 0.028 s
% 7.25/2.36 # Maximum resident set size: 7124 pages
% 7.25/2.36
%------------------------------------------------------------------------------