TSTP Solution File: SEU164+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SEU164+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n010.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:03 EDT 2022
% Result : Theorem 10.45s 2.81s
% Output : CNFRefutation 10.45s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 8
% Syntax : Number of clauses : 27 ( 6 unt; 10 nHn; 17 RR)
% Number of literals : 65 ( 20 equ; 26 neg)
% Maximal clause size : 4 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 1 con; 0-2 aty)
% Number of variables : 49 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_15,plain,
( X1 = union(X2)
| ~ in(X3,X2)
| ~ in(esk5_2(X2,X1),X3)
| ~ in(esk5_2(X2,X1),X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-nms641ia/input.p',i_0_15) ).
cnf(i_0_13,plain,
( X1 = union(X2)
| in(esk5_2(X2,X1),X1)
| in(esk6_2(X2,X1),X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-nms641ia/input.p',i_0_13) ).
cnf(i_0_8,plain,
( in(X1,X2)
| X2 != powerset(X3)
| ~ subset(X1,X3) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-nms641ia/input.p',i_0_8) ).
cnf(i_0_9,plain,
( subset(X1,X2)
| X3 != powerset(X2)
| ~ in(X1,X3) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-nms641ia/input.p',i_0_9) ).
cnf(i_0_24,plain,
subset(X1,X1),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-nms641ia/input.p',i_0_24) ).
cnf(i_0_12,plain,
( in(X1,X2)
| ~ in(X1,X3)
| ~ subset(X3,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-nms641ia/input.p',i_0_12) ).
cnf(i_0_14,plain,
( X1 = union(X2)
| in(esk5_2(X2,X1),X1)
| in(esk5_2(X2,X1),esk6_2(X2,X1)) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-nms641ia/input.p',i_0_14) ).
cnf(i_0_27,negated_conjecture,
union(powerset(esk8_0)) != esk8_0,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-nms641ia/input.p',i_0_27) ).
cnf(c_0_36,plain,
( X1 = union(X2)
| ~ in(X3,X2)
| ~ in(esk5_2(X2,X1),X3)
| ~ in(esk5_2(X2,X1),X1) ),
i_0_15 ).
cnf(c_0_37,plain,
( X1 = union(X2)
| in(esk5_2(X2,X1),X1)
| in(esk6_2(X2,X1),X2) ),
i_0_13 ).
cnf(c_0_38,plain,
( in(X1,X2)
| X2 != powerset(X3)
| ~ subset(X1,X3) ),
i_0_8 ).
cnf(c_0_39,plain,
( X1 = union(X2)
| in(esk6_2(X2,X1),X2)
| ~ in(X1,X2) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_37]),c_0_37]) ).
cnf(c_0_40,plain,
( in(X1,powerset(X2))
| ~ subset(X1,X2) ),
inference(er,[status(thm)],[c_0_38]) ).
cnf(c_0_41,plain,
( subset(X1,X2)
| X3 != powerset(X2)
| ~ in(X1,X3) ),
i_0_9 ).
cnf(c_0_42,plain,
( X1 = union(powerset(X2))
| in(esk6_2(powerset(X2),X1),powerset(X2))
| ~ subset(X1,X2) ),
inference(spm,[status(thm)],[c_0_39,c_0_40]) ).
cnf(c_0_43,plain,
subset(X1,X1),
i_0_24 ).
cnf(c_0_44,plain,
( subset(X1,X2)
| ~ in(X1,powerset(X2)) ),
inference(er,[status(thm)],[c_0_41]) ).
cnf(c_0_45,plain,
( union(powerset(X1)) = X1
| in(esk6_2(powerset(X1),X1),powerset(X1)) ),
inference(spm,[status(thm)],[c_0_42,c_0_43]) ).
cnf(c_0_46,plain,
( in(X1,X2)
| ~ in(X1,X3)
| ~ subset(X3,X2) ),
i_0_12 ).
cnf(c_0_47,plain,
( union(powerset(X1)) = X1
| subset(esk6_2(powerset(X1),X1),X1) ),
inference(spm,[status(thm)],[c_0_44,c_0_45]) ).
cnf(c_0_48,plain,
( union(powerset(X1)) = X1
| in(X2,X1)
| ~ in(X2,esk6_2(powerset(X1),X1)) ),
inference(spm,[status(thm)],[c_0_46,c_0_47]) ).
cnf(c_0_49,plain,
( X1 = union(X2)
| in(esk5_2(X2,X1),X1)
| in(esk5_2(X2,X1),esk6_2(X2,X1)) ),
i_0_14 ).
cnf(c_0_50,plain,
( union(powerset(X1)) = X1
| in(esk5_2(powerset(X1),X1),X1) ),
inference(spm,[status(thm)],[c_0_48,c_0_49]) ).
cnf(c_0_51,plain,
( union(powerset(X1)) = X1
| ~ in(X1,powerset(X1)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_50]),c_0_50]) ).
cnf(c_0_52,negated_conjecture,
union(powerset(esk8_0)) != esk8_0,
i_0_27 ).
cnf(c_0_53,plain,
union(powerset(X1)) = X1,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_40]),c_0_43])]) ).
cnf(c_0_54,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_52,c_0_53])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : SEU164+1 : TPTP v8.1.0. Released v3.3.0.
% 0.08/0.14 % Command : enigmatic-eprover.py %s %d 1
% 0.13/0.36 % Computer : n010.cluster.edu
% 0.13/0.36 % Model : x86_64 x86_64
% 0.13/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.36 % Memory : 8042.1875MB
% 0.13/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.36 % CPULimit : 300
% 0.13/0.36 % WCLimit : 600
% 0.13/0.36 % DateTime : Mon Jun 20 06:07:09 EDT 2022
% 0.13/0.36 % CPUTime :
% 0.21/0.47 # ENIGMATIC: Selected complete mode:
% 10.45/2.81 # ENIGMATIC: Solved by autoschedule:
% 10.45/2.81 # No SInE strategy applied
% 10.45/2.81 # Trying AutoSched0 for 150 seconds
% 10.45/2.81 # AutoSched0-Mode selected heuristic G_E___107_C41_F1_PI_AE_Q4_CS_SP_PS_S2U
% 10.45/2.81 # and selection function SelectNewComplexAHPExceptRRHorn.
% 10.45/2.81 #
% 10.45/2.81 # Preprocessing time : 0.025 s
% 10.45/2.81 # Presaturation interreduction done
% 10.45/2.81
% 10.45/2.81 # Proof found!
% 10.45/2.81 # SZS status Theorem
% 10.45/2.81 # SZS output start CNFRefutation
% See solution above
% 10.45/2.81 # Training examples: 0 positive, 0 negative
% 10.45/2.81
% 10.45/2.81 # -------------------------------------------------
% 10.45/2.81 # User time : 0.177 s
% 10.45/2.81 # System time : 0.012 s
% 10.45/2.81 # Total time : 0.189 s
% 10.45/2.81 # Maximum resident set size: 7120 pages
% 10.45/2.81
%------------------------------------------------------------------------------