TSTP Solution File: SET605+3 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SET605+3 : TPTP v8.1.0. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n028.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:12:41 EDT 2022
% Result : Theorem 6.82s 2.33s
% Output : CNFRefutation 6.82s
% Verified :
% SZS Type : Refutation
% Derivation depth : 2
% Number of leaves : 3
% Syntax : Number of clauses : 7 ( 5 unt; 0 nHn; 5 RR)
% Number of literals : 9 ( 4 equ; 4 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 3 ( 1 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 ( 2 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_25,negated_conjecture,
difference(esk4_0,union(esk4_0,esk5_0)) != empty_set,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-z6kq9lru/input.p',i_0_25) ).
cnf(i_0_2,plain,
( difference(X1,X2) = empty_set
| ~ subset(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-z6kq9lru/input.p',i_0_2) ).
cnf(i_0_1,plain,
subset(X1,union(X1,X2)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-z6kq9lru/input.p',i_0_1) ).
cnf(c_0_29,negated_conjecture,
difference(esk4_0,union(esk4_0,esk5_0)) != empty_set,
i_0_25 ).
cnf(c_0_30,plain,
( difference(X1,X2) = empty_set
| ~ subset(X1,X2) ),
i_0_2 ).
cnf(c_0_31,plain,
subset(X1,union(X1,X2)),
i_0_1 ).
cnf(c_0_32,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_31])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : SET605+3 : TPTP v8.1.0. Released v2.2.0.
% 0.06/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.11/0.32 % Computer : n028.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 : Mon Jul 11 02:11:45 EDT 2022
% 0.11/0.32 % CPUTime :
% 0.17/0.43 # ENIGMATIC: Selected complete mode:
% 6.82/2.33 # ENIGMATIC: Solved by autoschedule:
% 6.82/2.33 # No SInE strategy applied
% 6.82/2.33 # Trying AutoSched0 for 150 seconds
% 6.82/2.33 # AutoSched0-Mode selected heuristic G_E___205_C45_F1_AE_CS_SP_PI_S0Y
% 6.82/2.33 # and selection function SelectMaxLComplexAvoidPosPred.
% 6.82/2.33 #
% 6.82/2.33 # Preprocessing time : 0.023 s
% 6.82/2.33
% 6.82/2.33 # Proof found!
% 6.82/2.33 # SZS status Theorem
% 6.82/2.33 # SZS output start CNFRefutation
% See solution above
% 6.82/2.33 # Training examples: 0 positive, 0 negative
% 6.82/2.33
% 6.82/2.33 # -------------------------------------------------
% 6.82/2.33 # User time : 0.026 s
% 6.82/2.33 # System time : 0.003 s
% 6.82/2.33 # Total time : 0.029 s
% 6.82/2.33 # Maximum resident set size: 7120 pages
% 6.82/2.33
%------------------------------------------------------------------------------