%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SEU169+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n006.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 08:39:08 EDT 2022
% Result : Theorem 7.84s 2.41s
% Output : CNFRefutation 7.84s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 7
% Syntax : Number of clauses : 19 ( 11 unt; 2 nHn; 19 RR)
% Number of literals : 33 ( 2 equ; 16 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 3 con; 0-1 aty)
% Number of variables : 21 ( 2 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_5,plain,
( subset(X1,X2)
| X3 != powerset(X2)
| ~ in(X1,X3) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-oqlfusls/lgb.p',i_0_5) ).
cnf(i_0_9,plain,
( empty(X1)
| in(X2,X1)
| ~ element(X2,X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-oqlfusls/lgb.p',i_0_9) ).
cnf(i_0_21,negated_conjecture,
element(esk5_0,powerset(esk4_0)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-oqlfusls/lgb.p',i_0_21) ).
cnf(i_0_17,plain,
~ empty(powerset(X1)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-oqlfusls/lgb.p',i_0_17) ).
cnf(i_0_12,plain,
( in(X1,X2)
| ~ in(X1,X3)
| ~ subset(X3,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-oqlfusls/lgb.p',i_0_12) ).
cnf(i_0_20,negated_conjecture,
in(esk6_0,esk5_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-oqlfusls/lgb.p',i_0_20) ).
cnf(i_0_19,negated_conjecture,
~ in(esk6_0,esk4_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-oqlfusls/lgb.p',i_0_19) ).
cnf(c_0_29,plain,
( subset(X1,X2)
| X3 != powerset(X2)
| ~ in(X1,X3) ),
i_0_5 ).
cnf(c_0_30,plain,
( empty(X1)
| in(X2,X1)
| ~ element(X2,X1) ),
i_0_9 ).
cnf(c_0_31,negated_conjecture,
element(esk5_0,powerset(esk4_0)),
i_0_21 ).
cnf(c_0_32,plain,
~ empty(powerset(X1)),
i_0_17 ).
cnf(c_0_33,plain,
( subset(X1,X2)
| ~ in(X1,powerset(X2)) ),
inference(er,[status(thm)],[c_0_29]) ).
cnf(c_0_34,negated_conjecture,
in(esk5_0,powerset(esk4_0)),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_32]) ).
cnf(c_0_35,plain,
( in(X1,X2)
| ~ in(X1,X3)
| ~ subset(X3,X2) ),
i_0_12 ).
cnf(c_0_36,negated_conjecture,
subset(esk5_0,esk4_0),
inference(spm,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_37,plain,
( in(X1,esk4_0)
| ~ in(X1,esk5_0) ),
inference(spm,[status(thm)],[c_0_35,c_0_36]) ).
cnf(c_0_38,negated_conjecture,
in(esk6_0,esk5_0),
i_0_20 ).
cnf(c_0_39,negated_conjecture,
~ in(esk6_0,esk4_0),
i_0_19 ).
cnf(c_0_40,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_38]),c_0_39]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SEU169+1 : TPTP v8.1.0. Released v3.3.0.
% 0.12/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n006.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 : Sat Jun 18 22:37:12 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.19/0.45 # ENIGMATIC: Selected complete mode:
% 7.84/2.41 # ENIGMATIC: Solved by autoschedule-lgb:
% 7.84/2.41 # No SInE strategy applied
% 7.84/2.41 # Trying AutoSched0 for 150 seconds
% 7.84/2.41 # AutoSched0-Mode selected heuristic G_____0026_C18_F1_SE_CS_SP_S4S
% 7.84/2.41 # and selection function SelectNewComplexAHPNS.
% 7.84/2.41 #
% 7.84/2.41 # Preprocessing time : 0.023 s
% 7.84/2.41
% 7.84/2.41 # Proof found!
% 7.84/2.41 # SZS status Theorem
% 7.84/2.41 # SZS output start CNFRefutation
% See solution above
% 7.84/2.41 # Training examples: 0 positive, 0 negative
% 7.84/2.41
% 7.84/2.41 # -------------------------------------------------
% 7.84/2.41 # User time : 0.024 s
% 7.84/2.41 # System time : 0.008 s
% 7.84/2.41 # Total time : 0.032 s
% 7.84/2.41 # Maximum resident set size: 7124 pages
% 7.84/2.41
%------------------------------------------------------------------------------