TSTP Solution File: SET954+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SET954+1 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n023.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:30 EDT 2022
% Result : Theorem 7.52s 2.47s
% Output : CNFRefutation 7.52s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 6
% Syntax : Number of clauses : 20 ( 11 unt; 0 nHn; 18 RR)
% Number of literals : 32 ( 2 equ; 15 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; 4 con; 0-2 aty)
% Number of variables : 40 ( 9 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_7,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-i12x54gu/input.p',i_0_7) ).
cnf(i_0_2,plain,
unordered_pair(X1,X2) = unordered_pair(X2,X1),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-i12x54gu/input.p',i_0_2) ).
cnf(i_0_11,negated_conjecture,
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-i12x54gu/input.p',i_0_11) ).
cnf(i_0_6,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-i12x54gu/input.p',i_0_6) ).
cnf(i_0_10,negated_conjecture,
~ in(unordered_pair(unordered_pair(esk4_0,esk3_0),singleton(esk4_0)),cartesian_product2(esk6_0,esk5_0)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-i12x54gu/input.p',i_0_10) ).
cnf(i_0_5,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-i12x54gu/input.p',i_0_5) ).
cnf(c_0_18,plain,
( in(X1,X2)
| ~ in(unordered_pair(unordered_pair(X1,X3),singleton(X1)),cartesian_product2(X2,X4)) ),
i_0_7 ).
cnf(c_0_19,plain,
unordered_pair(X1,X2) = unordered_pair(X2,X1),
i_0_2 ).
cnf(c_0_20,negated_conjecture,
in(unordered_pair(unordered_pair(esk3_0,esk4_0),singleton(esk3_0)),cartesian_product2(esk5_0,esk6_0)),
i_0_11 ).
cnf(c_0_21,plain,
( in(X1,X2)
| ~ in(unordered_pair(unordered_pair(X3,X1),singleton(X3)),cartesian_product2(X4,X2)) ),
i_0_6 ).
cnf(c_0_22,negated_conjecture,
~ in(unordered_pair(unordered_pair(esk4_0,esk3_0),singleton(esk4_0)),cartesian_product2(esk6_0,esk5_0)),
i_0_10 ).
cnf(c_0_23,plain,
( in(unordered_pair(unordered_pair(X1,X2),singleton(X1)),cartesian_product2(X3,X4))
| ~ in(X2,X4)
| ~ in(X1,X3) ),
i_0_5 ).
cnf(c_0_24,plain,
( in(X1,X2)
| ~ in(unordered_pair(singleton(X1),unordered_pair(X1,X3)),cartesian_product2(X2,X4)) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_25,negated_conjecture,
in(unordered_pair(singleton(esk3_0),unordered_pair(esk3_0,esk4_0)),cartesian_product2(esk5_0,esk6_0)),
inference(rw,[status(thm)],[c_0_20,c_0_19]) ).
cnf(c_0_26,plain,
( in(X1,X2)
| ~ in(unordered_pair(singleton(X3),unordered_pair(X3,X1)),cartesian_product2(X4,X2)) ),
inference(spm,[status(thm)],[c_0_21,c_0_19]) ).
cnf(c_0_27,negated_conjecture,
~ in(unordered_pair(unordered_pair(esk3_0,esk4_0),singleton(esk4_0)),cartesian_product2(esk6_0,esk5_0)),
inference(rw,[status(thm)],[c_0_22,c_0_19]) ).
cnf(c_0_28,plain,
( in(unordered_pair(unordered_pair(X1,X2),singleton(X2)),cartesian_product2(X3,X4))
| ~ in(X1,X4)
| ~ in(X2,X3) ),
inference(spm,[status(thm)],[c_0_23,c_0_19]) ).
cnf(c_0_29,negated_conjecture,
in(esk3_0,esk5_0),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_30,negated_conjecture,
in(esk4_0,esk6_0),
inference(spm,[status(thm)],[c_0_26,c_0_25]) ).
cnf(c_0_31,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_29]),c_0_30])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : SET954+1 : TPTP v8.1.0. Released v3.2.0.
% 0.08/0.14 % Command : enigmatic-eprover.py %s %d 1
% 0.14/0.35 % Computer : n023.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 600
% 0.14/0.35 % DateTime : Sat Jul 9 17:57:27 EDT 2022
% 0.14/0.36 % CPUTime :
% 0.22/0.47 # ENIGMATIC: Selected complete mode:
% 7.52/2.47 # ENIGMATIC: Solved by autoschedule:
% 7.52/2.47 # No SInE strategy applied
% 7.52/2.47 # Trying AutoSched0 for 150 seconds
% 7.52/2.47 # AutoSched0-Mode selected heuristic G_E___107_B42_F1_PI_AE_Q4_CS_SP_PS_S0Y
% 7.52/2.47 # and selection function SelectMaxLComplexAvoidPosPred.
% 7.52/2.47 #
% 7.52/2.47 # Preprocessing time : 0.020 s
% 7.52/2.47 # Presaturation interreduction done
% 7.52/2.47
% 7.52/2.47 # Proof found!
% 7.52/2.47 # SZS status Theorem
% 7.52/2.47 # SZS output start CNFRefutation
% See solution above
% 7.52/2.47 # Training examples: 0 positive, 0 negative
% 7.52/2.47
% 7.52/2.47 # -------------------------------------------------
% 7.52/2.47 # User time : 0.023 s
% 7.52/2.47 # System time : 0.003 s
% 7.52/2.47 # Total time : 0.026 s
% 7.52/2.47 # Maximum resident set size: 7124 pages
% 7.52/2.47
%------------------------------------------------------------------------------