TSTP Solution File: SEU165+3 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SEU165+3 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n018.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:05 EDT 2022
% Result : Theorem 8.26s 2.46s
% Output : CNFRefutation 8.26s
% 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_11,plain,
( in(X1,X2)
| ~ in(unordered_pair(unordered_pair(X3,X1),singleton(X3)),cartesian_product2(X4,X2)) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-qmbm2td4/input.p',i_0_11) ).
cnf(i_0_7,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/sandbox2/tmp/enigma-theBenchmark.p-qmbm2td4/input.p',i_0_7) ).
cnf(i_0_9,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/sandbox2/tmp/enigma-theBenchmark.p-qmbm2td4/input.p',i_0_9) ).
cnf(i_0_12,plain,
( in(X1,X2)
| ~ in(unordered_pair(unordered_pair(X1,X3),singleton(X1)),cartesian_product2(X2,X4)) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-qmbm2td4/input.p',i_0_12) ).
cnf(i_0_8,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/sandbox2/tmp/enigma-theBenchmark.p-qmbm2td4/input.p',i_0_8) ).
cnf(i_0_10,plain,
( in(unordered_pair(unordered_pair(X1,X2),singleton(X1)),cartesian_product2(X3,X4))
| ~ in(X2,X4)
| ~ in(X1,X3) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-qmbm2td4/input.p',i_0_10) ).
cnf(c_0_19,plain,
( in(X1,X2)
| ~ in(unordered_pair(unordered_pair(X3,X1),singleton(X3)),cartesian_product2(X4,X2)) ),
i_0_11 ).
cnf(c_0_20,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_7 ).
cnf(c_0_21,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_9 ).
cnf(c_0_22,negated_conjecture,
in(esk4_0,esk6_0),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_23,plain,
( in(X1,X2)
| ~ in(unordered_pair(unordered_pair(X1,X3),singleton(X1)),cartesian_product2(X2,X4)) ),
i_0_12 ).
cnf(c_0_24,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_8 ).
cnf(c_0_25,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_21,c_0_22])]) ).
cnf(c_0_26,negated_conjecture,
in(esk3_0,esk5_0),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_27,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_25,c_0_26])]) ).
cnf(c_0_28,plain,
( in(unordered_pair(unordered_pair(X1,X2),singleton(X1)),cartesian_product2(X3,X4))
| ~ in(X2,X4)
| ~ in(X1,X3) ),
i_0_10 ).
cnf(c_0_29,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_22]),c_0_26])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SEU165+3 : TPTP v8.1.0. Released v3.2.0.
% 0.11/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.13/0.34 % Computer : n018.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Mon Jun 20 07:37:52 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.19/0.46 # ENIGMATIC: Selected complete mode:
% 8.26/2.46 # ENIGMATIC: Solved by autoschedule:
% 8.26/2.46 # No SInE strategy applied
% 8.26/2.46 # Trying AutoSched0 for 150 seconds
% 8.26/2.46 # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S0Y_ni
% 8.26/2.46 # and selection function SelectMaxLComplexAvoidPosPred.
% 8.26/2.46 #
% 8.26/2.46 # Preprocessing time : 0.012 s
% 8.26/2.46 # Presaturation interreduction done
% 8.26/2.46
% 8.26/2.46 # Proof found!
% 8.26/2.46 # SZS status Theorem
% 8.26/2.46 # SZS output start CNFRefutation
% See solution above
% 8.26/2.46 # Training examples: 0 positive, 0 negative
% 8.26/2.46
% 8.26/2.46 # -------------------------------------------------
% 8.26/2.46 # User time : 0.015 s
% 8.26/2.46 # System time : 0.003 s
% 8.26/2.46 # Total time : 0.018 s
% 8.26/2.46 # Maximum resident set size: 7120 pages
% 8.26/2.46
%------------------------------------------------------------------------------