TSTP Solution File: SEU382+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SEU382+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n014.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:41:43 EDT 2022
% Result : Theorem 7.64s 2.42s
% Output : CNFRefutation 7.64s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 7
% Syntax : Number of clauses : 20 ( 10 unt; 0 nHn; 13 RR)
% Number of literals : 35 ( 14 equ; 17 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-3 aty)
% Number of functors : 6 ( 6 usr; 1 con; 0-2 aty)
% Number of variables : 32 ( 4 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_193,plain,
( X1 = X2
| rel_str_of(X1,X3) != rel_str_of(X2,X4)
| ~ relation_of2(X3,X1,X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-fn4csclw/lgb.p',i_0_193) ).
cnf(i_0_288,plain,
( relation_of2(X1,X2,X3)
| ~ relation_of2_as_subset(X1,X2,X3) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-fn4csclw/lgb.p',i_0_288) ).
cnf(i_0_124,plain,
( relation_of2_as_subset(the_InternalRel(X1),the_carrier(X1),the_carrier(X1))
| ~ rel_str(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-fn4csclw/lgb.p',i_0_124) ).
cnf(i_0_114,plain,
rel_str(rel_str_of(X1,inclusion_order(X1))),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-fn4csclw/lgb.p',i_0_114) ).
cnf(i_0_1,plain,
( rel_str_of(the_carrier(X1),the_InternalRel(X1)) = X1
| ~ rel_str(X1)
| ~ strict_rel_str(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-fn4csclw/lgb.p',i_0_1) ).
cnf(i_0_155,plain,
strict_rel_str(rel_str_of(X1,inclusion_order(X1))),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-fn4csclw/lgb.p',i_0_155) ).
cnf(i_0_295,negated_conjecture,
the_carrier(rel_str_of(powerset(esk22_0),inclusion_order(powerset(esk22_0)))) != powerset(esk22_0),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-fn4csclw/lgb.p',i_0_295) ).
cnf(c_0_303,plain,
( X1 = X2
| rel_str_of(X1,X3) != rel_str_of(X2,X4)
| ~ relation_of2(X3,X1,X1) ),
i_0_193 ).
cnf(c_0_304,plain,
( relation_of2(X1,X2,X3)
| ~ relation_of2_as_subset(X1,X2,X3) ),
i_0_288 ).
cnf(c_0_305,plain,
( relation_of2_as_subset(the_InternalRel(X1),the_carrier(X1),the_carrier(X1))
| ~ rel_str(X1) ),
i_0_124 ).
cnf(c_0_306,plain,
rel_str(rel_str_of(X1,inclusion_order(X1))),
i_0_114 ).
cnf(c_0_307,plain,
( rel_str_of(the_carrier(X1),the_InternalRel(X1)) = X1
| ~ rel_str(X1)
| ~ strict_rel_str(X1) ),
i_0_1 ).
cnf(c_0_308,plain,
strict_rel_str(rel_str_of(X1,inclusion_order(X1))),
i_0_155 ).
cnf(c_0_309,plain,
( X1 = X2
| rel_str_of(X1,X3) != rel_str_of(X2,X4)
| ~ relation_of2_as_subset(X3,X1,X1) ),
inference(spm,[status(thm)],[c_0_303,c_0_304]) ).
cnf(c_0_310,plain,
relation_of2_as_subset(the_InternalRel(rel_str_of(X1,inclusion_order(X1))),the_carrier(rel_str_of(X1,inclusion_order(X1))),the_carrier(rel_str_of(X1,inclusion_order(X1)))),
inference(spm,[status(thm)],[c_0_305,c_0_306]) ).
cnf(c_0_311,plain,
rel_str_of(the_carrier(rel_str_of(X1,inclusion_order(X1))),the_InternalRel(rel_str_of(X1,inclusion_order(X1)))) = rel_str_of(X1,inclusion_order(X1)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_307,c_0_308]),c_0_306])]) ).
cnf(c_0_312,plain,
( the_carrier(rel_str_of(X1,inclusion_order(X1))) = X2
| rel_str_of(X1,inclusion_order(X1)) != rel_str_of(X2,X3) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_309,c_0_310]),c_0_311]) ).
cnf(c_0_313,negated_conjecture,
the_carrier(rel_str_of(powerset(esk22_0),inclusion_order(powerset(esk22_0)))) != powerset(esk22_0),
i_0_295 ).
cnf(c_0_314,plain,
the_carrier(rel_str_of(X1,inclusion_order(X1))) = X1,
inference(er,[status(thm)],[c_0_312]) ).
cnf(c_0_315,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_313,c_0_314])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : SEU382+1 : TPTP v8.1.0. Released v3.3.0.
% 0.06/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n014.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 21:31:35 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.18/0.44 # ENIGMATIC: Selected complete mode:
% 7.64/2.42 # ENIGMATIC: Solved by autoschedule-lgb:
% 7.64/2.42 # No SInE strategy applied
% 7.64/2.42 # Trying AutoSched0 for 150 seconds
% 7.64/2.42 # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_S059I
% 7.64/2.42 # and selection function SelectComplexExceptUniqMaxPosHorn.
% 7.64/2.42 #
% 7.64/2.42 # Preprocessing time : 0.019 s
% 7.64/2.42 # Presaturation interreduction done
% 7.64/2.42
% 7.64/2.42 # Proof found!
% 7.64/2.42 # SZS status Theorem
% 7.64/2.42 # SZS output start CNFRefutation
% See solution above
% 7.64/2.42 # Training examples: 0 positive, 0 negative
% 7.64/2.42
% 7.64/2.42 # -------------------------------------------------
% 7.64/2.42 # User time : 0.021 s
% 7.64/2.42 # System time : 0.005 s
% 7.64/2.42 # Total time : 0.025 s
% 7.64/2.42 # Maximum resident set size: 7128 pages
% 7.64/2.42
%------------------------------------------------------------------------------