TSTP Solution File: SET930+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SET930+1 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n010.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:21 EDT 2022
% Result : Theorem 7.91s 2.30s
% Output : CNFRefutation 7.91s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 10
% Syntax : Number of clauses : 32 ( 16 unt; 11 nHn; 19 RR)
% Number of literals : 57 ( 29 equ; 25 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 : 44 ( 2 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_4,plain,
( set_difference(unordered_pair(X1,X2),X3) = singleton(X1)
| in(X1,X3)
| X1 != X2 ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-7ydjj1ik/input.p',i_0_4) ).
cnf(i_0_10,plain,
( set_difference(unordered_pair(X1,X2),X3) = unordered_pair(X1,X2)
| in(X2,X3)
| in(X1,X3) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-7ydjj1ik/input.p',i_0_10) ).
cnf(i_0_1,plain,
( ~ in(X1,X2)
| ~ in(X2,X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-7ydjj1ik/input.p',i_0_1) ).
cnf(i_0_18,negated_conjecture,
set_difference(unordered_pair(esk3_0,esk4_0),esk5_0) != singleton(esk3_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-7ydjj1ik/input.p',i_0_18) ).
cnf(i_0_16,negated_conjecture,
set_difference(unordered_pair(esk3_0,esk4_0),esk5_0) != unordered_pair(esk3_0,esk4_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-7ydjj1ik/input.p',i_0_16) ).
cnf(i_0_5,plain,
( set_difference(unordered_pair(X1,X2),X3) = singleton(X1)
| in(X1,X3)
| ~ in(X2,X3) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-7ydjj1ik/input.p',i_0_5) ).
cnf(i_0_17,negated_conjecture,
set_difference(unordered_pair(esk3_0,esk4_0),esk5_0) != singleton(esk4_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-7ydjj1ik/input.p',i_0_17) ).
cnf(i_0_2,plain,
unordered_pair(X1,X2) = unordered_pair(X2,X1),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-7ydjj1ik/input.p',i_0_2) ).
cnf(i_0_19,negated_conjecture,
set_difference(unordered_pair(esk3_0,esk4_0),esk5_0) != empty_set,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-7ydjj1ik/input.p',i_0_19) ).
cnf(i_0_13,plain,
( set_difference(unordered_pair(X1,X2),X3) = empty_set
| ~ in(X2,X3)
| ~ in(X1,X3) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-7ydjj1ik/input.p',i_0_13) ).
cnf(c_0_30,plain,
( set_difference(unordered_pair(X1,X2),X3) = singleton(X1)
| in(X1,X3)
| X1 != X2 ),
i_0_4 ).
cnf(c_0_31,plain,
( set_difference(unordered_pair(X1,X2),X3) = unordered_pair(X1,X2)
| in(X2,X3)
| in(X1,X3) ),
i_0_10 ).
cnf(c_0_32,plain,
( set_difference(unordered_pair(X1,X1),X2) = singleton(X1)
| in(X1,X2) ),
inference(er,[status(thm)],[c_0_30]) ).
cnf(c_0_33,plain,
( ~ in(X1,X2)
| ~ in(X2,X1) ),
i_0_1 ).
cnf(c_0_34,plain,
( singleton(X1) = unordered_pair(X1,X1)
| in(X1,X2) ),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_35,plain,
( singleton(X1) = unordered_pair(X1,X1)
| ~ in(X2,X1) ),
inference(spm,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_36,plain,
( singleton(X1) = unordered_pair(X1,X1)
| singleton(X2) = unordered_pair(X2,X2) ),
inference(spm,[status(thm)],[c_0_35,c_0_34]) ).
cnf(c_0_37,negated_conjecture,
set_difference(unordered_pair(esk3_0,esk4_0),esk5_0) != singleton(esk3_0),
i_0_18 ).
cnf(c_0_38,plain,
singleton(X1) = unordered_pair(X1,X1),
inference(ef,[status(thm)],[c_0_36]) ).
cnf(c_0_39,negated_conjecture,
set_difference(unordered_pair(esk3_0,esk4_0),esk5_0) != unordered_pair(esk3_0,esk4_0),
i_0_16 ).
cnf(c_0_40,negated_conjecture,
set_difference(unordered_pair(esk3_0,esk4_0),esk5_0) != unordered_pair(esk3_0,esk3_0),
inference(rw,[status(thm)],[c_0_37,c_0_38]) ).
cnf(c_0_41,plain,
( set_difference(unordered_pair(X1,X2),X3) = singleton(X1)
| in(X1,X3)
| ~ in(X2,X3) ),
i_0_5 ).
cnf(c_0_42,negated_conjecture,
( in(esk4_0,esk5_0)
| in(esk3_0,esk5_0) ),
inference(spm,[status(thm)],[c_0_39,c_0_31]) ).
cnf(c_0_43,negated_conjecture,
set_difference(unordered_pair(esk3_0,esk4_0),esk5_0) != singleton(esk4_0),
i_0_17 ).
cnf(c_0_44,plain,
unordered_pair(X1,X2) = unordered_pair(X2,X1),
i_0_2 ).
cnf(c_0_45,negated_conjecture,
set_difference(unordered_pair(esk3_0,esk4_0),esk5_0) != empty_set,
i_0_19 ).
cnf(c_0_46,plain,
( set_difference(unordered_pair(X1,X2),X3) = empty_set
| ~ in(X2,X3)
| ~ in(X1,X3) ),
i_0_13 ).
cnf(c_0_47,negated_conjecture,
in(esk3_0,esk5_0),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_41]),c_0_38])]),c_0_42]) ).
cnf(c_0_48,negated_conjecture,
set_difference(unordered_pair(esk3_0,esk4_0),esk5_0) != unordered_pair(esk4_0,esk4_0),
inference(rw,[status(thm)],[c_0_43,c_0_38]) ).
cnf(c_0_49,plain,
( set_difference(unordered_pair(X1,X2),X3) = singleton(X2)
| in(X2,X3)
| ~ in(X1,X3) ),
inference(spm,[status(thm)],[c_0_41,c_0_44]) ).
cnf(c_0_50,negated_conjecture,
~ in(esk4_0,esk5_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_46]),c_0_47])]) ).
cnf(c_0_51,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_49]),c_0_38]),c_0_47])]),c_0_50]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.11 % Problem : SET930+1 : TPTP v8.1.0. Released v3.2.0.
% 0.10/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.11/0.32 % Computer : n010.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 300
% 0.11/0.32 % WCLimit : 600
% 0.11/0.32 % DateTime : Sat Jul 9 21:16:02 EDT 2022
% 0.11/0.32 % CPUTime :
% 0.18/0.43 # ENIGMATIC: Selected complete mode:
% 7.91/2.30 # ENIGMATIC: Solved by autoschedule:
% 7.91/2.30 # No SInE strategy applied
% 7.91/2.30 # Trying AutoSched0 for 150 seconds
% 7.91/2.30 # AutoSched0-Mode selected heuristic G_____0010_evo
% 7.91/2.30 # and selection function SelectMaxLComplexAvoidPosPred.
% 7.91/2.30 #
% 7.91/2.30 # Preprocessing time : 0.012 s
% 7.91/2.30
% 7.91/2.30 # Proof found!
% 7.91/2.30 # SZS status Theorem
% 7.91/2.30 # SZS output start CNFRefutation
% See solution above
% 7.91/2.30 # Training examples: 0 positive, 0 negative
% 7.91/2.30
% 7.91/2.30 # -------------------------------------------------
% 7.91/2.30 # User time : 0.012 s
% 7.91/2.30 # System time : 0.008 s
% 7.91/2.30 # Total time : 0.020 s
% 7.91/2.30 # Maximum resident set size: 7120 pages
% 7.91/2.30
%------------------------------------------------------------------------------