%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SET933+1 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n011.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:22 EDT 2022
% Result : Theorem 4.56s 2.24s
% Output : CNFRefutation 4.56s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 4
% Syntax : Number of clauses : 11 ( 6 unt; 0 nHn; 9 RR)
% Number of literals : 18 ( 2 equ; 10 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 1 con; 0-1 aty)
% Number of variables : 14 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_11,negated_conjecture,
~ subset(singleton(esk4_0),powerset(esk4_0)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-tvy57687/input.p',i_0_11) ).
cnf(i_0_6,plain,
( subset(singleton(X1),X2)
| ~ in(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-tvy57687/input.p',i_0_6) ).
cnf(i_0_4,plain,
( in(X1,X2)
| X2 != powerset(X3)
| ~ subset(X1,X3) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-tvy57687/input.p',i_0_4) ).
cnf(i_0_10,plain,
subset(X1,X1),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-tvy57687/input.p',i_0_10) ).
cnf(c_0_16,negated_conjecture,
~ subset(singleton(esk4_0),powerset(esk4_0)),
i_0_11 ).
cnf(c_0_17,plain,
( subset(singleton(X1),X2)
| ~ in(X1,X2) ),
i_0_6 ).
cnf(c_0_18,plain,
( in(X1,X2)
| X2 != powerset(X3)
| ~ subset(X1,X3) ),
i_0_4 ).
cnf(c_0_19,negated_conjecture,
~ in(esk4_0,powerset(esk4_0)),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_20,plain,
( in(X1,powerset(X2))
| ~ subset(X1,X2) ),
inference(er,[status(thm)],[c_0_18]) ).
cnf(c_0_21,plain,
subset(X1,X1),
i_0_10 ).
cnf(c_0_22,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_21])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.11 % Problem : SET933+1 : TPTP v8.1.0. Released v3.2.0.
% 0.10/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.13/0.33 % Computer : n011.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 600
% 0.13/0.33 % DateTime : Sat Jul 9 16:53:42 EDT 2022
% 0.13/0.33 % CPUTime :
% 0.19/0.44 # ENIGMATIC: Selected complete mode:
% 4.56/2.24 # ENIGMATIC: Solved by autoschedule:
% 4.56/2.24 # No SInE strategy applied
% 4.56/2.24 # Trying AutoSched0 for 150 seconds
% 4.56/2.24 # AutoSched0-Mode selected heuristic G_____0010_evo
% 4.56/2.24 # and selection function SelectMaxLComplexAvoidPosPred.
% 4.56/2.24 #
% 4.56/2.24 # Preprocessing time : 0.013 s
% 4.56/2.24
% 4.56/2.24 # Proof found!
% 4.56/2.24 # SZS status Theorem
% 4.56/2.24 # SZS output start CNFRefutation
% See solution above
% 4.56/2.24 # Training examples: 0 positive, 0 negative
% 4.56/2.24
% 4.56/2.24 # -------------------------------------------------
% 4.56/2.24 # User time : 0.012 s
% 4.56/2.24 # System time : 0.004 s
% 4.56/2.24 # Total time : 0.017 s
% 4.56/2.24 # Maximum resident set size: 7120 pages
% 4.56/2.24
%------------------------------------------------------------------------------