TSTP Solution File: SEU167+2 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SEU167+2 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n018.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:07 EDT 2022
% Result : Theorem 11.57s 2.99s
% Output : CNFRefutation 11.57s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 9
% Syntax : Number of clauses : 25 ( 11 unt; 0 nHn; 17 RR)
% Number of literals : 44 ( 4 equ; 22 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 4 con; 0-2 aty)
% Number of variables : 41 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_17,plain,
( in(X1,X2)
| X2 != powerset(X3)
| ~ subset(X1,X3) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-v_z4ops8/lgb.p',i_0_17) ).
cnf(i_0_108,lemma,
( subset(cartesian_product2(X1,X2),cartesian_product2(X3,X2))
| ~ subset(X1,X3) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-v_z4ops8/lgb.p',i_0_108) ).
cnf(i_0_116,lemma,
( subset(X1,X2)
| ~ subset(X3,X2)
| ~ subset(X1,X3) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-v_z4ops8/lgb.p',i_0_116) ).
cnf(i_0_95,lemma,
( subset(X1,union(X2))
| ~ in(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-v_z4ops8/lgb.p',i_0_95) ).
cnf(i_0_111,negated_conjecture,
subset(esk19_0,esk20_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-v_z4ops8/lgb.p',i_0_111) ).
cnf(i_0_166,lemma,
union(powerset(X1)) = X1,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-v_z4ops8/lgb.p',i_0_166) ).
cnf(i_0_109,negated_conjecture,
~ subset(cartesian_product2(esk19_0,esk21_0),cartesian_product2(esk20_0,esk22_0)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-v_z4ops8/lgb.p',i_0_109) ).
cnf(i_0_107,lemma,
( subset(cartesian_product2(X1,X2),cartesian_product2(X1,X3))
| ~ subset(X2,X3) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-v_z4ops8/lgb.p',i_0_107) ).
cnf(i_0_110,negated_conjecture,
subset(esk21_0,esk22_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-v_z4ops8/lgb.p',i_0_110) ).
cnf(c_0_176,plain,
( in(X1,X2)
| X2 != powerset(X3)
| ~ subset(X1,X3) ),
i_0_17 ).
cnf(c_0_177,plain,
( in(X1,powerset(X2))
| ~ subset(X1,X2) ),
inference(er,[status(thm)],[c_0_176]) ).
cnf(c_0_178,lemma,
( subset(cartesian_product2(X1,X2),cartesian_product2(X3,X2))
| ~ subset(X1,X3) ),
i_0_108 ).
cnf(c_0_179,lemma,
( subset(X1,X2)
| ~ subset(X3,X2)
| ~ subset(X1,X3) ),
i_0_116 ).
cnf(c_0_180,lemma,
( subset(X1,union(X2))
| ~ in(X1,X2) ),
i_0_95 ).
cnf(c_0_181,plain,
( in(cartesian_product2(X1,X2),powerset(cartesian_product2(X3,X2)))
| ~ subset(X1,X3) ),
inference(spm,[status(thm)],[c_0_177,c_0_178]) ).
cnf(c_0_182,negated_conjecture,
subset(esk19_0,esk20_0),
i_0_111 ).
cnf(c_0_183,lemma,
( subset(X1,union(X2))
| ~ in(X3,X2)
| ~ subset(X1,X3) ),
inference(spm,[status(thm)],[c_0_179,c_0_180]) ).
cnf(c_0_184,negated_conjecture,
in(cartesian_product2(esk19_0,X1),powerset(cartesian_product2(esk20_0,X1))),
inference(spm,[status(thm)],[c_0_181,c_0_182]) ).
cnf(c_0_185,lemma,
union(powerset(X1)) = X1,
i_0_166 ).
cnf(c_0_186,negated_conjecture,
~ subset(cartesian_product2(esk19_0,esk21_0),cartesian_product2(esk20_0,esk22_0)),
i_0_109 ).
cnf(c_0_187,lemma,
( subset(X1,cartesian_product2(esk20_0,X2))
| ~ subset(X1,cartesian_product2(esk19_0,X2)) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_183,c_0_184]),c_0_185]) ).
cnf(c_0_188,negated_conjecture,
~ subset(cartesian_product2(esk19_0,esk21_0),cartesian_product2(esk19_0,esk22_0)),
inference(spm,[status(thm)],[c_0_186,c_0_187]) ).
cnf(c_0_189,lemma,
( subset(cartesian_product2(X1,X2),cartesian_product2(X1,X3))
| ~ subset(X2,X3) ),
i_0_107 ).
cnf(c_0_190,negated_conjecture,
subset(esk21_0,esk22_0),
i_0_110 ).
cnf(c_0_191,lemma,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_188,c_0_189]),c_0_190])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : SEU167+2 : TPTP v8.1.0. Released v3.3.0.
% 0.12/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.13/0.34 % Computer : n018.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Mon Jun 20 10:03:22 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.20/0.45 # ENIGMATIC: Selected complete mode:
% 11.57/2.99 # ENIGMATIC: Solved by autoschedule-lgb:
% 11.57/2.99 # No SInE strategy applied
% 11.57/2.99 # Trying AutoSched0 for 150 seconds
% 11.57/2.99 # AutoSched0-Mode selected heuristic G_E___107_B42_F1_PI_SE_Q4_CS_SP_PS_S5PRR_S0Y
% 11.57/2.99 # and selection function SelectMaxLComplexAvoidPosPred.
% 11.57/2.99 #
% 11.57/2.99 # Preprocessing time : 0.014 s
% 11.57/2.99 # Presaturation interreduction done
% 11.57/2.99
% 11.57/2.99 # Proof found!
% 11.57/2.99 # SZS status Theorem
% 11.57/2.99 # SZS output start CNFRefutation
% See solution above
% 11.57/2.99 # Training examples: 0 positive, 0 negative
% 11.57/2.99
% 11.57/2.99 # -------------------------------------------------
% 11.57/2.99 # User time : 0.451 s
% 11.57/2.99 # System time : 0.020 s
% 11.57/2.99 # Total time : 0.470 s
% 11.57/2.99 # Maximum resident set size: 7124 pages
% 11.57/2.99
%------------------------------------------------------------------------------