TSTP Solution File: SEU368+1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : SEU368+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n027.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 14:36:41 EDT 2022
% Result : Theorem 0.39s 0.58s
% Output : Refutation 0.39s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 13
% Syntax : Number of clauses : 31 ( 15 unt; 0 nHn; 31 RR)
% Number of literals : 59 ( 0 equ; 35 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 9 ( 8 usr; 1 prp; 0-3 aty)
% Number of functors : 12 ( 12 usr; 6 con; 0-2 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(23,axiom,
rel_str(incl_POSet(u)),
file('SEU368+1.p',unknown),
[] ).
cnf(24,axiom,
strict_rel_str(incl_POSet(u)),
file('SEU368+1.p',unknown),
[] ).
cnf(25,axiom,
reflexive_relstr(incl_POSet(u)),
file('SEU368+1.p',unknown),
[] ).
cnf(26,axiom,
transitive_relstr(incl_POSet(u)),
file('SEU368+1.p',unknown),
[] ).
cnf(27,axiom,
antisymmetric_relstr(incl_POSet(u)),
file('SEU368+1.p',unknown),
[] ).
cnf(37,axiom,
equal(inclusion_order(u),inclusion_relation(u)),
file('SEU368+1.p',unknown),
[] ).
cnf(39,axiom,
relation_of2_as_subset(inclusion_order(u),u,u),
file('SEU368+1.p',unknown),
[] ).
cnf(48,axiom,
equal(rel_str_of(u,inclusion_order(u)),incl_POSet(u)),
file('SEU368+1.p',unknown),
[] ).
cnf(58,axiom,
( ~ relation_of2_as_subset(u,v,w)
| relation_of2(u,v,w) ),
file('SEU368+1.p',unknown),
[] ).
cnf(68,axiom,
( ~ equal(the_carrier(incl_POSet(skc9)),skc9)
| ~ equal(the_InternalRel(incl_POSet(skc10)),inclusion_order(skc10)) ),
file('SEU368+1.p',unknown),
[] ).
cnf(69,axiom,
( ~ strict_rel_str(u)
| ~ rel_str(u)
| equal(rel_str_of(the_carrier(u),the_InternalRel(u)),u) ),
file('SEU368+1.p',unknown),
[] ).
cnf(74,axiom,
( ~ equal(rel_str_of(u,v),rel_str_of(w,x))
| ~ relation_of2(v,u,u)
| equal(u,w) ),
file('SEU368+1.p',unknown),
[] ).
cnf(75,axiom,
( ~ equal(rel_str_of(u,v),rel_str_of(w,x))
| ~ relation_of2(v,u,u)
| equal(v,x) ),
file('SEU368+1.p',unknown),
[] ).
cnf(84,plain,
relation_of2_as_subset(inclusion_relation(u),u,u),
inference(rew,[status(thm),theory(equality)],[37,39]),
[iquote('0:Rew:37.0,39.0')] ).
cnf(86,plain,
equal(rel_str_of(u,inclusion_relation(u)),incl_POSet(u)),
inference(rew,[status(thm),theory(equality)],[37,48]),
[iquote('0:Rew:37.0,48.0')] ).
cnf(87,plain,
( ~ equal(the_carrier(incl_POSet(skc9)),skc9)
| ~ equal(the_InternalRel(incl_POSet(skc10)),inclusion_relation(skc10)) ),
inference(rew,[status(thm),theory(equality)],[37,68]),
[iquote('0:Rew:37.0,68.1')] ).
cnf(141,plain,
relation_of2(inclusion_relation(u),u,u),
inference(res,[status(thm),theory(equality)],[84,58]),
[iquote('0:Res:84.0,58.0')] ).
cnf(298,plain,
( ~ equal(incl_POSet(u),rel_str_of(v,w))
| ~ relation_of2(inclusion_relation(u),u,u)
| equal(u,v) ),
inference(spl,[status(thm),theory(equality)],[86,74]),
[iquote('0:SpL:86.0,74.0')] ).
cnf(302,plain,
( ~ equal(incl_POSet(u),rel_str_of(v,w))
| equal(u,v) ),
inference(mrr,[status(thm)],[298,141]),
[iquote('0:MRR:298.1,141.0')] ).
cnf(325,plain,
( ~ equal(incl_POSet(u),rel_str_of(v,w))
| ~ relation_of2(inclusion_relation(u),u,u)
| equal(inclusion_relation(u),w) ),
inference(spl,[status(thm),theory(equality)],[86,75]),
[iquote('0:SpL:86.0,75.0')] ).
cnf(329,plain,
( ~ equal(incl_POSet(u),rel_str_of(v,w))
| equal(inclusion_relation(u),w) ),
inference(mrr,[status(thm)],[325,141]),
[iquote('0:MRR:325.1,141.0')] ).
cnf(346,plain,
( ~ strict_rel_str(u)
| ~ rel_str(u)
| ~ equal(incl_POSet(v),u)
| equal(v,the_carrier(u)) ),
inference(spl,[status(thm),theory(equality)],[69,302]),
[iquote('0:SpL:69.2,302.0')] ).
cnf(432,plain,
( ~ strict_rel_str(u)
| ~ rel_str(u)
| ~ equal(incl_POSet(v),u)
| equal(inclusion_relation(v),the_InternalRel(u)) ),
inference(spl,[status(thm),theory(equality)],[69,329]),
[iquote('0:SpL:69.2,329.0')] ).
cnf(848,plain,
( ~ strict_rel_str(incl_POSet(u))
| ~ rel_str(incl_POSet(u))
| equal(the_carrier(incl_POSet(u)),u) ),
inference(eqr,[status(thm),theory(equality)],[346]),
[iquote('0:EqR:346.2')] ).
cnf(849,plain,
equal(the_carrier(incl_POSet(u)),u),
inference(ssi,[status(thm)],[848,24,27,26,25,23]),
[iquote('0:SSi:848.1,848.0,24.0,27.0,26.0,25.0,23.0,24.0,27.0,26.0,25.0,23.0')] ).
cnf(850,plain,
( ~ equal(skc9,skc9)
| ~ equal(the_InternalRel(incl_POSet(skc10)),inclusion_relation(skc10)) ),
inference(rew,[status(thm),theory(equality)],[849,87]),
[iquote('0:Rew:849.0,87.0')] ).
cnf(851,plain,
~ equal(the_InternalRel(incl_POSet(skc10)),inclusion_relation(skc10)),
inference(obv,[status(thm),theory(equality)],[850]),
[iquote('0:Obv:850.0')] ).
cnf(959,plain,
( ~ strict_rel_str(incl_POSet(skc10))
| ~ rel_str(incl_POSet(skc10))
| ~ equal(incl_POSet(u),incl_POSet(skc10))
| ~ equal(inclusion_relation(u),inclusion_relation(skc10)) ),
inference(spl,[status(thm),theory(equality)],[432,851]),
[iquote('0:SpL:432.3,851.0')] ).
cnf(961,plain,
( ~ equal(incl_POSet(u),incl_POSet(skc10))
| ~ equal(inclusion_relation(u),inclusion_relation(skc10)) ),
inference(ssi,[status(thm)],[959,24,27,26,25,23]),
[iquote('0:SSi:959.1,959.0,24.0,27.0,26.0,25.0,23.0,24.0,27.0,26.0,25.0,23.0')] ).
cnf(1516,plain,
~ equal(incl_POSet(skc10),incl_POSet(skc10)),
inference(eqr,[status(thm),theory(equality)],[961]),
[iquote('0:EqR:961.1')] ).
cnf(1523,plain,
$false,
inference(obv,[status(thm),theory(equality)],[1516]),
[iquote('0:Obv:1516.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SEU368+1 : TPTP v8.1.0. Released v3.3.0.
% 0.03/0.13 % Command : run_spass %d %s
% 0.12/0.34 % Computer : n027.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Sun Jun 19 20:02:39 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.39/0.58
% 0.39/0.58 SPASS V 3.9
% 0.39/0.58 SPASS beiseite: Proof found.
% 0.39/0.58 % SZS status Theorem
% 0.39/0.58 Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.39/0.58 SPASS derived 1135 clauses, backtracked 0 clauses, performed 0 splits and kept 586 clauses.
% 0.39/0.58 SPASS allocated 99043 KBytes.
% 0.39/0.58 SPASS spent 0:00:00.22 on the problem.
% 0.39/0.58 0:00:00.04 for the input.
% 0.39/0.58 0:00:00.03 for the FLOTTER CNF translation.
% 0.39/0.58 0:00:00.02 for inferences.
% 0.39/0.58 0:00:00.00 for the backtracking.
% 0.39/0.58 0:00:00.10 for the reduction.
% 0.39/0.58
% 0.39/0.58
% 0.39/0.58 Here is a proof with depth 4, length 31 :
% 0.39/0.58 % SZS output start Refutation
% See solution above
% 0.39/0.58 Formulae used in the proof : dt_k2_yellow_1 fc5_yellow_1 redefinition_k1_yellow_1 dt_k1_yellow_1 d1_yellow_1 redefinition_m2_relset_1 t1_yellow_1 abstractness_v1_orders_2 free_g1_orders_2
% 0.39/0.58
%------------------------------------------------------------------------------