%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SET932+1 : TPTP v8.1.0. Released v3.2.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 00:15:22 EDT 2022
% Result : Theorem 7.50s 2.27s
% Output : CNFRefutation 7.50s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 7
% Syntax : Number of clauses : 21 ( 5 unt; 5 nHn; 16 RR)
% Number of literals : 43 ( 4 equ; 19 neg)
% Maximal clause size : 3 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 35 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_5,plain,
( subset(X1,X2)
| X3 != powerset(X2)
| ~ in(X1,X3) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-mq93lntx/lgb.p',i_0_5) ).
cnf(i_0_12,plain,
( subset(X1,X2)
| ~ subset(X3,X2)
| ~ subset(X1,X3) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-mq93lntx/lgb.p',i_0_12) ).
cnf(i_0_14,negated_conjecture,
subset(esk5_0,esk6_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-mq93lntx/lgb.p',i_0_14) ).
cnf(i_0_7,plain,
( subset(X1,X2)
| in(esk2_2(X1,X2),X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-mq93lntx/lgb.p',i_0_7) ).
cnf(i_0_4,plain,
( in(X1,X2)
| X2 != powerset(X3)
| ~ subset(X1,X3) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-mq93lntx/lgb.p',i_0_4) ).
cnf(i_0_6,plain,
( subset(X1,X2)
| ~ in(esk2_2(X1,X2),X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-mq93lntx/lgb.p',i_0_6) ).
cnf(i_0_13,negated_conjecture,
~ subset(powerset(esk5_0),powerset(esk6_0)),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-mq93lntx/lgb.p',i_0_13) ).
cnf(c_0_22,plain,
( subset(X1,X2)
| X3 != powerset(X2)
| ~ in(X1,X3) ),
i_0_5 ).
cnf(c_0_23,plain,
( subset(X1,X2)
| ~ subset(X3,X2)
| ~ subset(X1,X3) ),
i_0_12 ).
cnf(c_0_24,negated_conjecture,
subset(esk5_0,esk6_0),
i_0_14 ).
cnf(c_0_25,plain,
( subset(X1,X2)
| ~ in(X1,powerset(X2)) ),
inference(er,[status(thm)],[c_0_22]) ).
cnf(c_0_26,plain,
( subset(X1,X2)
| in(esk2_2(X1,X2),X1) ),
i_0_7 ).
cnf(c_0_27,plain,
( in(X1,X2)
| X2 != powerset(X3)
| ~ subset(X1,X3) ),
i_0_4 ).
cnf(c_0_28,negated_conjecture,
( subset(X1,esk6_0)
| ~ subset(X1,esk5_0) ),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_29,plain,
( subset(esk2_2(powerset(X1),X2),X1)
| subset(powerset(X1),X2) ),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_30,plain,
( in(X1,powerset(X2))
| ~ subset(X1,X2) ),
inference(er,[status(thm)],[c_0_27]) ).
cnf(c_0_31,negated_conjecture,
( subset(esk2_2(powerset(esk5_0),X1),esk6_0)
| subset(powerset(esk5_0),X1) ),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_32,plain,
( subset(X1,X2)
| ~ in(esk2_2(X1,X2),X2) ),
i_0_6 ).
cnf(c_0_33,plain,
( in(esk2_2(powerset(esk5_0),X1),powerset(esk6_0))
| subset(powerset(esk5_0),X1) ),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_34,negated_conjecture,
~ subset(powerset(esk5_0),powerset(esk6_0)),
i_0_13 ).
cnf(c_0_35,plain,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_34]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SET932+1 : TPTP v8.1.0. Released v3.2.0.
% 0.00/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 : Mon Jul 11 05:12:37 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.18/0.45 # ENIGMATIC: Selected complete mode:
% 7.50/2.27 # ENIGMATIC: Solved by autoschedule-lgb:
% 7.50/2.27 # No SInE strategy applied
% 7.50/2.27 # Trying AutoSched0 for 150 seconds
% 7.50/2.27 # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S00DA
% 7.50/2.27 # and selection function SelectSmallestOrientable.
% 7.50/2.27 #
% 7.50/2.27 # Preprocessing time : 0.022 s
% 7.50/2.27 # Presaturation interreduction done
% 7.50/2.27
% 7.50/2.27 # Proof found!
% 7.50/2.27 # SZS status Theorem
% 7.50/2.27 # SZS output start CNFRefutation
% See solution above
% 7.50/2.27 # Training examples: 0 positive, 0 negative
% 7.50/2.27
% 7.50/2.27 # -------------------------------------------------
% 7.50/2.27 # User time : 0.024 s
% 7.50/2.27 # System time : 0.005 s
% 7.50/2.27 # Total time : 0.028 s
% 7.50/2.27 # Maximum resident set size: 7124 pages
% 7.50/2.27
%------------------------------------------------------------------------------