TSTP Solution File: SEU110+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SEU110+1 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n013.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:30 EDT 2022
% Result : Theorem 8.59s 2.53s
% Output : CNFRefutation 8.59s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 9
% Syntax : Number of clauses : 27 ( 7 unt; 6 nHn; 19 RR)
% Number of literals : 64 ( 6 equ; 33 neg)
% Maximal clause size : 5 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 47 ( 5 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_16,plain,
( subset(X1,X2)
| X3 != finite_subsets(X2)
| ~ preboolean(X3)
| ~ in(X1,X3) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-mainhlyf/lgb.p',i_0_16) ).
cnf(i_0_25,plain,
preboolean(finite_subsets(X1)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-mainhlyf/lgb.p',i_0_25) ).
cnf(i_0_60,plain,
( subset(X1,X2)
| ~ subset(X3,X2)
| ~ subset(X1,X3) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-mainhlyf/lgb.p',i_0_60) ).
cnf(i_0_62,negated_conjecture,
subset(esk13_0,esk14_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-mainhlyf/lgb.p',i_0_62) ).
cnf(i_0_9,plain,
( subset(X1,X2)
| in(esk1_2(X1,X2),X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-mainhlyf/lgb.p',i_0_9) ).
cnf(i_0_15,plain,
( finite(X1)
| X2 != finite_subsets(X3)
| ~ preboolean(X2)
| ~ in(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-mainhlyf/lgb.p',i_0_15) ).
cnf(i_0_14,plain,
( in(X1,X2)
| X2 != finite_subsets(X3)
| ~ finite(X1)
| ~ preboolean(X2)
| ~ subset(X1,X3) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-mainhlyf/lgb.p',i_0_14) ).
cnf(i_0_8,plain,
( subset(X1,X2)
| ~ in(esk1_2(X1,X2),X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-mainhlyf/lgb.p',i_0_8) ).
cnf(i_0_61,negated_conjecture,
~ subset(finite_subsets(esk13_0),finite_subsets(esk14_0)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-mainhlyf/lgb.p',i_0_61) ).
cnf(c_0_72,plain,
( subset(X1,X2)
| X3 != finite_subsets(X2)
| ~ preboolean(X3)
| ~ in(X1,X3) ),
i_0_16 ).
cnf(c_0_73,plain,
preboolean(finite_subsets(X1)),
i_0_25 ).
cnf(c_0_74,plain,
( subset(X1,X2)
| ~ subset(X3,X2)
| ~ subset(X1,X3) ),
i_0_60 ).
cnf(c_0_75,negated_conjecture,
subset(esk13_0,esk14_0),
i_0_62 ).
cnf(c_0_76,plain,
( subset(X1,X2)
| ~ in(X1,finite_subsets(X2)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[c_0_72]),c_0_73])]) ).
cnf(c_0_77,plain,
( subset(X1,X2)
| in(esk1_2(X1,X2),X1) ),
i_0_9 ).
cnf(c_0_78,plain,
( finite(X1)
| X2 != finite_subsets(X3)
| ~ preboolean(X2)
| ~ in(X1,X2) ),
i_0_15 ).
cnf(c_0_79,plain,
( in(X1,X2)
| X2 != finite_subsets(X3)
| ~ finite(X1)
| ~ preboolean(X2)
| ~ subset(X1,X3) ),
i_0_14 ).
cnf(c_0_80,negated_conjecture,
( subset(X1,esk14_0)
| ~ subset(X1,esk13_0) ),
inference(spm,[status(thm)],[c_0_74,c_0_75]) ).
cnf(c_0_81,plain,
( subset(esk1_2(finite_subsets(X1),X2),X1)
| subset(finite_subsets(X1),X2) ),
inference(spm,[status(thm)],[c_0_76,c_0_77]) ).
cnf(c_0_82,plain,
( finite(X1)
| ~ in(X1,finite_subsets(X2)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[c_0_78]),c_0_73])]) ).
cnf(c_0_83,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_79]),c_0_73])]) ).
cnf(c_0_84,negated_conjecture,
( subset(esk1_2(finite_subsets(esk13_0),X1),esk14_0)
| subset(finite_subsets(esk13_0),X1) ),
inference(spm,[status(thm)],[c_0_80,c_0_81]) ).
cnf(c_0_85,plain,
( finite(esk1_2(finite_subsets(X1),X2))
| subset(finite_subsets(X1),X2) ),
inference(spm,[status(thm)],[c_0_82,c_0_77]) ).
cnf(c_0_86,plain,
( subset(X1,X2)
| ~ in(esk1_2(X1,X2),X2) ),
i_0_8 ).
cnf(c_0_87,plain,
( in(esk1_2(finite_subsets(esk13_0),X1),finite_subsets(esk14_0))
| subset(finite_subsets(esk13_0),X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_83,c_0_84]),c_0_85]) ).
cnf(c_0_88,negated_conjecture,
~ subset(finite_subsets(esk13_0),finite_subsets(esk14_0)),
i_0_61 ).
cnf(c_0_89,plain,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_86,c_0_87]),c_0_88]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13 % Problem : SEU110+1 : TPTP v8.1.0. Released v3.2.0.
% 0.04/0.14 % Command : enigmatic-eprover.py %s %d 1
% 0.14/0.35 % Computer : n013.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 20:37:46 EDT 2022
% 0.14/0.35 % CPUTime :
% 0.20/0.46 # ENIGMATIC: Selected complete mode:
% 8.59/2.53 # ENIGMATIC: Solved by autoschedule-lgb:
% 8.59/2.53 # No SInE strategy applied
% 8.59/2.53 # Trying AutoSched0 for 150 seconds
% 8.59/2.53 # AutoSched0-Mode selected heuristic G_E___208_B00_00_F1_SE_CS_SP_PS_S071I
% 8.59/2.53 # and selection function SelectCQArEqLast.
% 8.59/2.53 #
% 8.59/2.53 # Preprocessing time : 0.013 s
% 8.59/2.53 # Presaturation interreduction done
% 8.59/2.53
% 8.59/2.53 # Proof found!
% 8.59/2.53 # SZS status Theorem
% 8.59/2.53 # SZS output start CNFRefutation
% See solution above
% 8.59/2.53 # Training examples: 0 positive, 0 negative
% 8.59/2.53
% 8.59/2.53 # -------------------------------------------------
% 8.59/2.53 # User time : 0.049 s
% 8.59/2.53 # System time : 0.009 s
% 8.59/2.53 # Total time : 0.058 s
% 8.59/2.53 # Maximum resident set size: 7128 pages
% 8.59/2.53
%------------------------------------------------------------------------------