TSTP Solution File: SEU117+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SEU117+1 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n009.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.81s 2.39s
% Output : CNFRefutation 7.81s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 7
% Syntax : Number of clauses : 18 ( 11 unt; 2 nHn; 16 RR)
% Number of literals : 31 ( 2 equ; 15 neg)
% Maximal clause size : 4 ( 1 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 : 20 ( 4 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_66,plain,
( subset(X1,X2)
| X3 != finite_subsets(X2)
| ~ preboolean(X3)
| ~ in(X1,X3) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-4pi_5x2d/lgb.p',i_0_66) ).
cnf(i_0_16,plain,
preboolean(finite_subsets(X1)),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-4pi_5x2d/lgb.p',i_0_16) ).
cnf(i_0_4,plain,
( empty(X1)
| in(X2,X1)
| ~ element(X2,X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-4pi_5x2d/lgb.p',i_0_4) ).
cnf(i_0_60,negated_conjecture,
element(esk12_0,finite_subsets(esk11_0)),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-4pi_5x2d/lgb.p',i_0_60) ).
cnf(i_0_19,plain,
~ empty(finite_subsets(X1)),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-4pi_5x2d/lgb.p',i_0_19) ).
cnf(i_0_55,plain,
( element(X1,powerset(X2))
| ~ subset(X1,X2) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-4pi_5x2d/lgb.p',i_0_55) ).
cnf(i_0_59,negated_conjecture,
~ element(esk12_0,powerset(esk11_0)),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-4pi_5x2d/lgb.p',i_0_59) ).
cnf(c_0_74,plain,
( subset(X1,X2)
| X3 != finite_subsets(X2)
| ~ preboolean(X3)
| ~ in(X1,X3) ),
i_0_66 ).
cnf(c_0_75,plain,
preboolean(finite_subsets(X1)),
i_0_16 ).
cnf(c_0_76,plain,
( empty(X1)
| in(X2,X1)
| ~ element(X2,X1) ),
i_0_4 ).
cnf(c_0_77,negated_conjecture,
element(esk12_0,finite_subsets(esk11_0)),
i_0_60 ).
cnf(c_0_78,plain,
~ empty(finite_subsets(X1)),
i_0_19 ).
cnf(c_0_79,plain,
( subset(X1,X2)
| ~ in(X1,finite_subsets(X2)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[c_0_74]),c_0_75])]) ).
cnf(c_0_80,negated_conjecture,
in(esk12_0,finite_subsets(esk11_0)),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_76,c_0_77]),c_0_78]) ).
cnf(c_0_81,plain,
( element(X1,powerset(X2))
| ~ subset(X1,X2) ),
i_0_55 ).
cnf(c_0_82,negated_conjecture,
subset(esk12_0,esk11_0),
inference(spm,[status(thm)],[c_0_79,c_0_80]) ).
cnf(c_0_83,negated_conjecture,
~ element(esk12_0,powerset(esk11_0)),
i_0_59 ).
cnf(c_0_84,plain,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_81,c_0_82]),c_0_83]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13 % Problem : SEU117+1 : TPTP v8.1.0. Released v3.2.0.
% 0.12/0.14 % Command : enigmatic-eprover.py %s %d 1
% 0.14/0.35 % Computer : n009.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 600
% 0.14/0.35 % DateTime : Sun Jun 19 05:06:39 EDT 2022
% 0.14/0.35 % CPUTime :
% 0.21/0.46 # ENIGMATIC: Selected complete mode:
% 7.81/2.39 # ENIGMATIC: Solved by autoschedule-lgb:
% 7.81/2.39 # No SInE strategy applied
% 7.81/2.39 # Trying AutoSched0 for 150 seconds
% 7.81/2.39 # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S058I
% 7.81/2.39 # and selection function PSelectMin2Infpos.
% 7.81/2.39 #
% 7.81/2.39 # Preprocessing time : 0.023 s
% 7.81/2.39 # Presaturation interreduction done
% 7.81/2.39
% 7.81/2.39 # Proof found!
% 7.81/2.39 # SZS status Theorem
% 7.81/2.39 # SZS output start CNFRefutation
% See solution above
% 7.81/2.39 # Training examples: 0 positive, 0 negative
% 7.81/2.39
% 7.81/2.39 # -------------------------------------------------
% 7.81/2.39 # User time : 0.024 s
% 7.81/2.39 # System time : 0.009 s
% 7.81/2.39 # Total time : 0.032 s
% 7.81/2.39 # Maximum resident set size: 7124 pages
% 7.81/2.39
%------------------------------------------------------------------------------