TSTP Solution File: SEU118+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SEU118+1 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n022.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:33 EDT 2022
% Result : Theorem 7.92s 2.43s
% Output : CNFRefutation 7.92s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 8
% Syntax : Number of clauses : 21 ( 10 unt; 0 nHn; 19 RR)
% Number of literals : 43 ( 2 equ; 24 neg)
% Maximal clause size : 5 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-1 aty)
% Number of variables : 26 ( 2 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_11,plain,
( in(X1,X2)
| X2 != finite_subsets(X3)
| ~ finite(X1)
| ~ preboolean(X2)
| ~ subset(X1,X3) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-pexkx7gp/lgb.p',i_0_11) ).
cnf(i_0_22,plain,
preboolean(finite_subsets(X1)),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-pexkx7gp/lgb.p',i_0_22) ).
cnf(i_0_57,plain,
( element(X1,X2)
| ~ in(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-pexkx7gp/lgb.p',i_0_57) ).
cnf(i_0_63,plain,
( subset(X1,X2)
| ~ element(X1,powerset(X2)) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-pexkx7gp/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-pexkx7gp/lgb.p',i_0_5) ).
cnf(i_0_61,negated_conjecture,
element(esk13_0,powerset(esk12_0)),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-pexkx7gp/lgb.p',i_0_61) ).
cnf(i_0_60,negated_conjecture,
finite(esk12_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-pexkx7gp/lgb.p',i_0_60) ).
cnf(i_0_59,negated_conjecture,
~ element(esk13_0,finite_subsets(esk12_0)),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-pexkx7gp/lgb.p',i_0_59) ).
cnf(c_0_72,plain,
( in(X1,X2)
| X2 != finite_subsets(X3)
| ~ finite(X1)
| ~ preboolean(X2)
| ~ subset(X1,X3) ),
i_0_11 ).
cnf(c_0_73,plain,
preboolean(finite_subsets(X1)),
i_0_22 ).
cnf(c_0_74,plain,
( element(X1,X2)
| ~ in(X1,X2) ),
i_0_57 ).
cnf(c_0_75,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_72]),c_0_73])]) ).
cnf(c_0_76,plain,
( element(X1,finite_subsets(X2))
| ~ finite(X1)
| ~ subset(X1,X2) ),
inference(spm,[status(thm)],[c_0_74,c_0_75]) ).
cnf(c_0_77,plain,
( subset(X1,X2)
| ~ element(X1,powerset(X2)) ),
i_0_63 ).
cnf(c_0_78,plain,
( finite(X1)
| ~ finite(X2)
| ~ element(X1,powerset(X2)) ),
i_0_5 ).
cnf(c_0_79,negated_conjecture,
element(esk13_0,powerset(esk12_0)),
i_0_61 ).
cnf(c_0_80,negated_conjecture,
finite(esk12_0),
i_0_60 ).
cnf(c_0_81,negated_conjecture,
~ element(esk13_0,finite_subsets(esk12_0)),
i_0_59 ).
cnf(c_0_82,plain,
( element(X1,finite_subsets(X2))
| ~ finite(X1)
| ~ element(X1,powerset(X2)) ),
inference(spm,[status(thm)],[c_0_76,c_0_77]) ).
cnf(c_0_83,negated_conjecture,
finite(esk13_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_78,c_0_79]),c_0_80])]) ).
cnf(c_0_84,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_81,c_0_82]),c_0_83]),c_0_79])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SEU118+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 : n022.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:26:03 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.19/0.44 # ENIGMATIC: Selected complete mode:
% 7.92/2.43 # ENIGMATIC: Solved by autoschedule-lgb:
% 7.92/2.43 # No SInE strategy applied
% 7.92/2.43 # Trying AutoSched0 for 150 seconds
% 7.92/2.43 # AutoSched0-Mode selected heuristic G_E___300_C18_F1_SE_CS_SP_S0Y
% 7.92/2.43 # and selection function SelectMaxLComplexAvoidPosPred.
% 7.92/2.43 #
% 7.92/2.43 # Preprocessing time : 0.024 s
% 7.92/2.43
% 7.92/2.43 # Proof found!
% 7.92/2.43 # SZS status Theorem
% 7.92/2.43 # SZS output start CNFRefutation
% See solution above
% 7.92/2.43 # Training examples: 0 positive, 0 negative
% 7.92/2.43
% 7.92/2.43 # -------------------------------------------------
% 7.92/2.43 # User time : 0.028 s
% 7.92/2.43 # System time : 0.006 s
% 7.92/2.43 # Total time : 0.034 s
% 7.92/2.43 # Maximum resident set size: 7120 pages
% 7.92/2.43
%------------------------------------------------------------------------------