TSTP Solution File: SEU164+3 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SEU164+3 : TPTP v8.1.0. Bugfixed v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n027.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:04 EDT 2022
% Result : Theorem 8.32s 2.36s
% Output : CNFRefutation 8.32s
% 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-gm9ydm8k/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-gm9ydm8k/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-gm9ydm8k/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-gm9ydm8k/input.p',i_0_9) ).
cnf(i_0_23,plain,
subset(X1,X1),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-gm9ydm8k/input.p',i_0_23) ).
cnf(i_0_12,plain,
( in(X1,X2)
| ~ in(X1,X3)
| ~ subset(X3,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-gm9ydm8k/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-gm9ydm8k/input.p',i_0_14) ).
cnf(i_0_26,negated_conjecture,
union(powerset(esk10_0)) != esk10_0,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-gm9ydm8k/input.p',i_0_26) ).
cnf(c_0_35,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_36,plain,
( X1 = union(X2)
| in(esk5_2(X2,X1),X1)
| in(esk6_2(X2,X1),X2) ),
i_0_13 ).
cnf(c_0_37,plain,
( in(X1,X2)
| X2 != powerset(X3)
| ~ subset(X1,X3) ),
i_0_8 ).
cnf(c_0_38,plain,
( X1 = union(X2)
| in(esk6_2(X2,X1),X2)
| ~ in(X1,X2) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),c_0_36]) ).
cnf(c_0_39,plain,
( in(X1,powerset(X2))
| ~ subset(X1,X2) ),
inference(er,[status(thm)],[c_0_37]) ).
cnf(c_0_40,plain,
( subset(X1,X2)
| X3 != powerset(X2)
| ~ in(X1,X3) ),
i_0_9 ).
cnf(c_0_41,plain,
( X1 = union(powerset(X2))
| in(esk6_2(powerset(X2),X1),powerset(X2))
| ~ subset(X1,X2) ),
inference(spm,[status(thm)],[c_0_38,c_0_39]) ).
cnf(c_0_42,plain,
subset(X1,X1),
i_0_23 ).
cnf(c_0_43,plain,
( subset(X1,X2)
| ~ in(X1,powerset(X2)) ),
inference(er,[status(thm)],[c_0_40]) ).
cnf(c_0_44,plain,
( union(powerset(X1)) = X1
| in(esk6_2(powerset(X1),X1),powerset(X1)) ),
inference(spm,[status(thm)],[c_0_41,c_0_42]) ).
cnf(c_0_45,plain,
( in(X1,X2)
| ~ in(X1,X3)
| ~ subset(X3,X2) ),
i_0_12 ).
cnf(c_0_46,plain,
( union(powerset(X1)) = X1
| subset(esk6_2(powerset(X1),X1),X1) ),
inference(spm,[status(thm)],[c_0_43,c_0_44]) ).
cnf(c_0_47,plain,
( union(powerset(X1)) = X1
| in(X2,X1)
| ~ in(X2,esk6_2(powerset(X1),X1)) ),
inference(spm,[status(thm)],[c_0_45,c_0_46]) ).
cnf(c_0_48,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_49,plain,
( union(powerset(X1)) = X1
| in(esk5_2(powerset(X1),X1),X1) ),
inference(spm,[status(thm)],[c_0_47,c_0_48]) ).
cnf(c_0_50,plain,
( union(powerset(X1)) = X1
| ~ in(X1,powerset(X1)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_49]),c_0_49]) ).
cnf(c_0_51,negated_conjecture,
union(powerset(esk10_0)) != esk10_0,
i_0_26 ).
cnf(c_0_52,plain,
union(powerset(X1)) = X1,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_39]),c_0_42])]) ).
cnf(c_0_53,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_51,c_0_52])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.11 % Problem : SEU164+3 : TPTP v8.1.0. Bugfixed v4.0.0.
% 0.07/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.11/0.33 % Computer : n027.cluster.edu
% 0.11/0.33 % Model : x86_64 x86_64
% 0.11/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.33 % Memory : 8042.1875MB
% 0.11/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33 % CPULimit : 300
% 0.11/0.33 % WCLimit : 600
% 0.11/0.33 % DateTime : Sun Jun 19 03:30:40 EDT 2022
% 0.11/0.33 % CPUTime :
% 0.18/0.44 # ENIGMATIC: Selected complete mode:
% 8.32/2.36 # ENIGMATIC: Solved by autoschedule:
% 8.32/2.36 # No SInE strategy applied
% 8.32/2.36 # Trying AutoSched0 for 150 seconds
% 8.32/2.36 # AutoSched0-Mode selected heuristic G_E___107_C41_F1_PI_AE_Q4_CS_SP_PS_S2U
% 8.32/2.36 # and selection function SelectNewComplexAHPExceptRRHorn.
% 8.32/2.36 #
% 8.32/2.36 # Preprocessing time : 0.024 s
% 8.32/2.36 # Presaturation interreduction done
% 8.32/2.36
% 8.32/2.36 # Proof found!
% 8.32/2.36 # SZS status Theorem
% 8.32/2.36 # SZS output start CNFRefutation
% See solution above
% 8.32/2.36 # Training examples: 0 positive, 0 negative
% 8.32/2.36
% 8.32/2.36 # -------------------------------------------------
% 8.32/2.36 # User time : 0.180 s
% 8.32/2.36 # System time : 0.012 s
% 8.32/2.36 # Total time : 0.191 s
% 8.32/2.36 # Maximum resident set size: 7120 pages
% 8.32/2.36
%------------------------------------------------------------------------------