TSTP Solution File: SET927+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SET927+1 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n021.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:20 EDT 2022
% Result : Theorem 7.30s 2.26s
% Output : CNFRefutation 7.30s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 8
% Syntax : Number of clauses : 25 ( 5 unt; 10 nHn; 20 RR)
% Number of literals : 57 ( 32 equ; 27 neg)
% Maximal clause size : 3 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 26 ( 2 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_12,plain,
( set_difference(unordered_pair(X1,X2),X3) != singleton(X1)
| ~ in(X1,X3) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-4yxd088v/lgb.p',i_0_12) ).
cnf(i_0_6,negated_conjecture,
( set_difference(unordered_pair(esk3_0,esk4_0),esk5_0) = singleton(esk3_0)
| ~ in(esk3_0,esk5_0) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-4yxd088v/lgb.p',i_0_6) ).
cnf(i_0_8,negated_conjecture,
( in(esk3_0,esk5_0)
| set_difference(unordered_pair(esk3_0,esk4_0),esk5_0) != singleton(esk3_0)
| ~ in(esk4_0,esk5_0) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-4yxd088v/lgb.p',i_0_8) ).
cnf(i_0_10,plain,
( set_difference(unordered_pair(X1,X2),X3) = singleton(X1)
| in(X1,X3)
| ~ in(X2,X3) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-4yxd088v/lgb.p',i_0_10) ).
cnf(i_0_5,negated_conjecture,
( esk3_0 = esk4_0
| set_difference(unordered_pair(esk3_0,esk4_0),esk5_0) = singleton(esk3_0)
| in(esk4_0,esk5_0) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-4yxd088v/lgb.p',i_0_5) ).
cnf(i_0_7,negated_conjecture,
( in(esk3_0,esk5_0)
| esk3_0 != esk4_0
| set_difference(unordered_pair(esk3_0,esk4_0),esk5_0) != singleton(esk3_0) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-4yxd088v/lgb.p',i_0_7) ).
cnf(i_0_11,plain,
( X1 = X2
| in(X1,X3)
| set_difference(unordered_pair(X2,X1),X3) != singleton(X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-4yxd088v/lgb.p',i_0_11) ).
cnf(i_0_9,plain,
( set_difference(unordered_pair(X1,X2),X3) = singleton(X1)
| in(X1,X3)
| X1 != X2 ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-4yxd088v/lgb.p',i_0_9) ).
cnf(c_0_21,plain,
( set_difference(unordered_pair(X1,X2),X3) != singleton(X1)
| ~ in(X1,X3) ),
i_0_12 ).
cnf(c_0_22,negated_conjecture,
( set_difference(unordered_pair(esk3_0,esk4_0),esk5_0) = singleton(esk3_0)
| ~ in(esk3_0,esk5_0) ),
i_0_6 ).
cnf(c_0_23,negated_conjecture,
( in(esk3_0,esk5_0)
| set_difference(unordered_pair(esk3_0,esk4_0),esk5_0) != singleton(esk3_0)
| ~ in(esk4_0,esk5_0) ),
i_0_8 ).
cnf(c_0_24,negated_conjecture,
~ in(esk3_0,esk5_0),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_25,negated_conjecture,
( set_difference(unordered_pair(esk3_0,esk4_0),esk5_0) != singleton(esk3_0)
| ~ in(esk4_0,esk5_0) ),
inference(sr,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_26,plain,
( set_difference(unordered_pair(X1,X2),X3) = singleton(X1)
| in(X1,X3)
| ~ in(X2,X3) ),
i_0_10 ).
cnf(c_0_27,negated_conjecture,
( esk3_0 = esk4_0
| set_difference(unordered_pair(esk3_0,esk4_0),esk5_0) = singleton(esk3_0)
| in(esk4_0,esk5_0) ),
i_0_5 ).
cnf(c_0_28,plain,
~ in(esk4_0,esk5_0),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_24]) ).
cnf(c_0_29,negated_conjecture,
( in(esk3_0,esk5_0)
| esk3_0 != esk4_0
| set_difference(unordered_pair(esk3_0,esk4_0),esk5_0) != singleton(esk3_0) ),
i_0_7 ).
cnf(c_0_30,plain,
( X1 = X2
| in(X1,X3)
| set_difference(unordered_pair(X2,X1),X3) != singleton(X2) ),
i_0_11 ).
cnf(c_0_31,negated_conjecture,
( set_difference(unordered_pair(esk3_0,esk4_0),esk5_0) = singleton(esk3_0)
| esk4_0 = esk3_0 ),
inference(sr,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_32,negated_conjecture,
( set_difference(unordered_pair(esk3_0,esk4_0),esk5_0) != singleton(esk3_0)
| esk4_0 != esk3_0 ),
inference(sr,[status(thm)],[c_0_29,c_0_24]) ).
cnf(c_0_33,negated_conjecture,
esk4_0 = esk3_0,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_28]) ).
cnf(c_0_34,plain,
( set_difference(unordered_pair(X1,X2),X3) = singleton(X1)
| in(X1,X3)
| X1 != X2 ),
i_0_9 ).
cnf(c_0_35,negated_conjecture,
set_difference(unordered_pair(esk3_0,esk3_0),esk5_0) != singleton(esk3_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_32,c_0_33]),c_0_33])]) ).
cnf(c_0_36,plain,
( set_difference(unordered_pair(X1,X1),X2) = singleton(X1)
| in(X1,X2) ),
inference(er,[status(thm)],[c_0_34]) ).
cnf(c_0_37,plain,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),c_0_24]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13 % Problem : SET927+1 : TPTP v8.1.0. Released v3.2.0.
% 0.12/0.14 % Command : enigmatic-eprover.py %s %d 1
% 0.14/0.35 % Computer : n021.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 : Mon Jul 11 04:52:25 EDT 2022
% 0.14/0.35 % CPUTime :
% 0.21/0.47 # ENIGMATIC: Selected complete mode:
% 7.30/2.26 # ENIGMATIC: Solved by autoschedule-lgb:
% 7.30/2.26 # No SInE strategy applied
% 7.30/2.26 # Trying AutoSched0 for 150 seconds
% 7.30/2.26 # AutoSched0-Mode selected heuristic G_____0010_evo
% 7.30/2.26 # and selection function SelectMaxLComplexAvoidPosPred.
% 7.30/2.26 #
% 7.30/2.26 # Preprocessing time : 0.022 s
% 7.30/2.26
% 7.30/2.26 # Proof found!
% 7.30/2.26 # SZS status Theorem
% 7.30/2.26 # SZS output start CNFRefutation
% See solution above
% 7.30/2.26 # Training examples: 0 positive, 0 negative
% 7.30/2.26
% 7.30/2.26 # -------------------------------------------------
% 7.30/2.26 # User time : 0.025 s
% 7.30/2.26 # System time : 0.006 s
% 7.30/2.26 # Total time : 0.031 s
% 7.30/2.26 # Maximum resident set size: 7120 pages
% 7.30/2.26
%------------------------------------------------------------------------------