TSTP Solution File: SET926+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SET926+1 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n012.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:19 EDT 2022
% Result : Theorem 4.58s 2.24s
% Output : CNFRefutation 4.58s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 4
% Syntax : Number of clauses : 10 ( 6 unt; 2 nHn; 8 RR)
% Number of literals : 14 ( 8 equ; 6 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 3 ( 2 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 8 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_9,negated_conjecture,
set_difference(singleton(esk3_0),esk4_0) != singleton(esk3_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-v9bde7x7/input.p',i_0_9) ).
cnf(i_0_3,plain,
( set_difference(singleton(X1),X2) = singleton(X1)
| in(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-v9bde7x7/input.p',i_0_3) ).
cnf(i_0_10,negated_conjecture,
set_difference(singleton(esk3_0),esk4_0) != empty_set,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-v9bde7x7/input.p',i_0_10) ).
cnf(i_0_5,plain,
( set_difference(singleton(X1),X2) = empty_set
| ~ in(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-v9bde7x7/input.p',i_0_5) ).
cnf(c_0_15,negated_conjecture,
set_difference(singleton(esk3_0),esk4_0) != singleton(esk3_0),
i_0_9 ).
cnf(c_0_16,plain,
( set_difference(singleton(X1),X2) = singleton(X1)
| in(X1,X2) ),
i_0_3 ).
cnf(c_0_17,negated_conjecture,
set_difference(singleton(esk3_0),esk4_0) != empty_set,
i_0_10 ).
cnf(c_0_18,plain,
( set_difference(singleton(X1),X2) = empty_set
| ~ in(X1,X2) ),
i_0_5 ).
cnf(c_0_19,negated_conjecture,
in(esk3_0,esk4_0),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_20,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_19])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : SET926+1 : TPTP v8.1.0. Released v3.2.0.
% 0.10/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n012.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 : Sun Jul 10 09:49:15 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.19/0.45 # ENIGMATIC: Selected complete mode:
% 4.58/2.24 # ENIGMATIC: Solved by autoschedule:
% 4.58/2.24 # No SInE strategy applied
% 4.58/2.24 # Trying AutoSched0 for 150 seconds
% 4.58/2.24 # AutoSched0-Mode selected heuristic G_____0010_evo
% 4.58/2.24 # and selection function SelectMaxLComplexAvoidPosPred.
% 4.58/2.24 #
% 4.58/2.24 # Preprocessing time : 0.023 s
% 4.58/2.24
% 4.58/2.24 # Proof found!
% 4.58/2.24 # SZS status Theorem
% 4.58/2.24 # SZS output start CNFRefutation
% See solution above
% 4.58/2.24 # Training examples: 0 positive, 0 negative
% 4.58/2.24
% 4.58/2.24 # -------------------------------------------------
% 4.58/2.24 # User time : 0.022 s
% 4.58/2.24 # System time : 0.008 s
% 4.58/2.24 # Total time : 0.030 s
% 4.58/2.24 # Maximum resident set size: 7116 pages
% 4.58/2.24
%------------------------------------------------------------------------------