TSTP Solution File: SEU114+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SEU114+1 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n024.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:38:32 EDT 2022
% Result : Theorem 8.60s 2.41s
% Output : CNFRefutation 8.60s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 11
% Syntax : Number of clauses : 32 ( 10 unt; 7 nHn; 22 RR)
% Number of literals : 68 ( 6 equ; 31 neg)
% Maximal clause size : 5 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 1 con; 0-2 aty)
% Number of variables : 48 ( 2 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_69,plain,
( subset(X1,X2)
| ~ element(X1,powerset(X2)) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-b74r3iuz/lgb.p',i_0_69) ).
cnf(i_0_63,plain,
( element(X1,X2)
| ~ in(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-b74r3iuz/lgb.p',i_0_63) ).
cnf(i_0_5,plain,
( finite(X1)
| ~ finite(X2)
| ~ element(X1,powerset(X2)) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-b74r3iuz/lgb.p',i_0_5) ).
cnf(i_0_17,plain,
( in(X1,X2)
| X2 != finite_subsets(X3)
| ~ finite(X1)
| ~ preboolean(X2)
| ~ subset(X1,X3) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-b74r3iuz/lgb.p',i_0_17) ).
cnf(i_0_28,plain,
preboolean(finite_subsets(X1)),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-b74r3iuz/lgb.p',i_0_28) ).
cnf(i_0_12,plain,
( subset(X1,X2)
| in(esk1_2(X1,X2),X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-b74r3iuz/lgb.p',i_0_12) ).
cnf(i_0_66,negated_conjecture,
finite(esk13_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-b74r3iuz/lgb.p',i_0_66) ).
cnf(i_0_11,plain,
( subset(X1,X2)
| ~ in(esk1_2(X1,X2),X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-b74r3iuz/lgb.p',i_0_11) ).
cnf(i_0_8,plain,
( X1 = X2
| ~ subset(X2,X1)
| ~ subset(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-b74r3iuz/lgb.p',i_0_8) ).
cnf(i_0_64,plain,
subset(finite_subsets(X1),powerset(X1)),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-b74r3iuz/lgb.p',i_0_64) ).
cnf(i_0_65,negated_conjecture,
finite_subsets(esk13_0) != powerset(esk13_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-b74r3iuz/lgb.p',i_0_65) ).
cnf(c_0_81,plain,
( subset(X1,X2)
| ~ element(X1,powerset(X2)) ),
i_0_69 ).
cnf(c_0_82,plain,
( element(X1,X2)
| ~ in(X1,X2) ),
i_0_63 ).
cnf(c_0_83,plain,
( finite(X1)
| ~ finite(X2)
| ~ element(X1,powerset(X2)) ),
i_0_5 ).
cnf(c_0_84,plain,
( in(X1,X2)
| X2 != finite_subsets(X3)
| ~ finite(X1)
| ~ preboolean(X2)
| ~ subset(X1,X3) ),
i_0_17 ).
cnf(c_0_85,plain,
preboolean(finite_subsets(X1)),
i_0_28 ).
cnf(c_0_86,plain,
( subset(X1,X2)
| ~ in(X1,powerset(X2)) ),
inference(spm,[status(thm)],[c_0_81,c_0_82]) ).
cnf(c_0_87,plain,
( subset(X1,X2)
| in(esk1_2(X1,X2),X1) ),
i_0_12 ).
cnf(c_0_88,plain,
( finite(X1)
| ~ finite(X2)
| ~ in(X1,powerset(X2)) ),
inference(spm,[status(thm)],[c_0_83,c_0_82]) ).
cnf(c_0_89,plain,
( in(X1,finite_subsets(X2))
| ~ finite(X1)
| ~ subset(X1,X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[c_0_84]),c_0_85])]) ).
cnf(c_0_90,plain,
( subset(esk1_2(powerset(X1),X2),X1)
| subset(powerset(X1),X2) ),
inference(spm,[status(thm)],[c_0_86,c_0_87]) ).
cnf(c_0_91,plain,
( finite(esk1_2(powerset(X1),X2))
| subset(powerset(X1),X2)
| ~ finite(X1) ),
inference(spm,[status(thm)],[c_0_88,c_0_87]) ).
cnf(c_0_92,negated_conjecture,
finite(esk13_0),
i_0_66 ).
cnf(c_0_93,plain,
( in(esk1_2(powerset(X1),X2),finite_subsets(X1))
| subset(powerset(X1),X2)
| ~ finite(esk1_2(powerset(X1),X2)) ),
inference(spm,[status(thm)],[c_0_89,c_0_90]) ).
cnf(c_0_94,negated_conjecture,
( finite(esk1_2(powerset(esk13_0),X1))
| subset(powerset(esk13_0),X1) ),
inference(spm,[status(thm)],[c_0_91,c_0_92]) ).
cnf(c_0_95,plain,
( subset(X1,X2)
| ~ in(esk1_2(X1,X2),X2) ),
i_0_11 ).
cnf(c_0_96,negated_conjecture,
( in(esk1_2(powerset(esk13_0),X1),finite_subsets(esk13_0))
| subset(powerset(esk13_0),X1) ),
inference(spm,[status(thm)],[c_0_93,c_0_94]) ).
cnf(c_0_97,plain,
( X1 = X2
| ~ subset(X2,X1)
| ~ subset(X1,X2) ),
i_0_8 ).
cnf(c_0_98,plain,
subset(powerset(esk13_0),finite_subsets(esk13_0)),
inference(spm,[status(thm)],[c_0_95,c_0_96]) ).
cnf(c_0_99,plain,
subset(finite_subsets(X1),powerset(X1)),
i_0_64 ).
cnf(c_0_100,negated_conjecture,
finite_subsets(esk13_0) != powerset(esk13_0),
i_0_65 ).
cnf(c_0_101,plain,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_97,c_0_98]),c_0_99])]),c_0_100]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SEU114+1 : TPTP v8.1.0. Released v3.2.0.
% 0.07/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n024.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 Jun 20 07:26:34 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.18/0.44 # ENIGMATIC: Selected complete mode:
% 8.60/2.41 # ENIGMATIC: Solved by autoschedule-lgb:
% 8.60/2.41 # No SInE strategy applied
% 8.60/2.41 # Trying AutoSched0 for 150 seconds
% 8.60/2.41 # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 8.60/2.41 # and selection function SelectComplexExceptUniqMaxHorn.
% 8.60/2.41 #
% 8.60/2.41 # Preprocessing time : 0.023 s
% 8.60/2.41 # Presaturation interreduction done
% 8.60/2.41
% 8.60/2.41 # Proof found!
% 8.60/2.41 # SZS status Theorem
% 8.60/2.41 # SZS output start CNFRefutation
% See solution above
% 8.60/2.41 # Training examples: 0 positive, 0 negative
% 8.60/2.41
% 8.60/2.41 # -------------------------------------------------
% 8.60/2.41 # User time : 0.035 s
% 8.60/2.41 # System time : 0.006 s
% 8.60/2.41 # Total time : 0.041 s
% 8.60/2.41 # Maximum resident set size: 7124 pages
% 8.60/2.41
%------------------------------------------------------------------------------