TSTP Solution File: SEU382+1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : SEU382+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n012.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:48 EDT 2022
% Result : Theorem 0.60s 0.80s
% Output : Refutation 0.60s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 12
% Syntax : Number of clauses : 20 ( 13 unt; 0 nHn; 20 RR)
% Number of literals : 33 ( 0 equ; 14 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; 5 con; 0-2 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(78,axiom,
rel_str(incl_POSet(u)),
file('SEU382+1.p',unknown),
[] ).
cnf(94,axiom,
strict_rel_str(incl_POSet(u)),
file('SEU382+1.p',unknown),
[] ).
cnf(95,axiom,
reflexive_relstr(incl_POSet(u)),
file('SEU382+1.p',unknown),
[] ).
cnf(96,axiom,
transitive_relstr(incl_POSet(u)),
file('SEU382+1.p',unknown),
[] ).
cnf(97,axiom,
antisymmetric_relstr(incl_POSet(u)),
file('SEU382+1.p',unknown),
[] ).
cnf(147,axiom,
relation_of2_as_subset(inclusion_order(u),u,u),
file('SEU382+1.p',unknown),
[] ).
cnf(167,axiom,
equal(incl_POSet(powerset(u)),boole_POSet(u)),
file('SEU382+1.p',unknown),
[] ).
cnf(169,axiom,
~ equal(the_carrier(boole_POSet(skc14)),powerset(skc14)),
file('SEU382+1.p',unknown),
[] ).
cnf(170,axiom,
equal(rel_str_of(u,inclusion_order(u)),incl_POSet(u)),
file('SEU382+1.p',unknown),
[] ).
cnf(189,axiom,
( ~ relation_of2_as_subset(u,v,w)
| relation_of2(u,v,w) ),
file('SEU382+1.p',unknown),
[] ).
cnf(229,axiom,
( ~ strict_rel_str(u)
| ~ rel_str(u)
| equal(rel_str_of(the_carrier(u),the_InternalRel(u)),u) ),
file('SEU382+1.p',unknown),
[] ).
cnf(236,axiom,
( ~ equal(rel_str_of(u,v),rel_str_of(w,x))
| ~ relation_of2(v,u,u)
| equal(u,w) ),
file('SEU382+1.p',unknown),
[] ).
cnf(318,plain,
relation_of2(inclusion_order(u),u,u),
inference(res,[status(thm),theory(equality)],[147,189]),
[iquote('0:Res:147.0,189.0')] ).
cnf(1366,plain,
( ~ equal(incl_POSet(u),rel_str_of(v,w))
| ~ relation_of2(inclusion_order(u),u,u)
| equal(u,v) ),
inference(spl,[status(thm),theory(equality)],[170,236]),
[iquote('0:SpL:170.0,236.0')] ).
cnf(1370,plain,
( ~ equal(incl_POSet(u),rel_str_of(v,w))
| equal(u,v) ),
inference(mrr,[status(thm)],[1366,318]),
[iquote('0:MRR:1366.1,318.0')] ).
cnf(2369,plain,
( ~ strict_rel_str(u)
| ~ rel_str(u)
| ~ equal(incl_POSet(v),u)
| equal(v,the_carrier(u)) ),
inference(spl,[status(thm),theory(equality)],[229,1370]),
[iquote('0:SpL:229.2,1370.0')] ).
cnf(3953,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)],[2369]),
[iquote('0:EqR:2369.2')] ).
cnf(3955,plain,
equal(the_carrier(incl_POSet(u)),u),
inference(ssi,[status(thm)],[3953,94,96,97,95,78]),
[iquote('0:SSi:3953.1,3953.0,94.0,96.0,97.0,95.0,78.0,94.0,96.0,97.0,95.0,78.0')] ).
cnf(3970,plain,
equal(the_carrier(boole_POSet(u)),powerset(u)),
inference(spr,[status(thm),theory(equality)],[167,3955]),
[iquote('0:SpR:167.0,3955.0')] ).
cnf(3974,plain,
$false,
inference(unc,[status(thm)],[3970,169]),
[iquote('0:UnC:3970.0,169.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : SEU382+1 : TPTP v8.1.0. Released v3.3.0.
% 0.10/0.13 % Command : run_spass %d %s
% 0.13/0.34 % Computer : n012.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 : Sat Jun 18 21:29:23 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.60/0.80
% 0.60/0.80 SPASS V 3.9
% 0.60/0.80 SPASS beiseite: Proof found.
% 0.60/0.80 % SZS status Theorem
% 0.60/0.80 Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.60/0.80 SPASS derived 3100 clauses, backtracked 0 clauses, performed 0 splits and kept 1201 clauses.
% 0.60/0.80 SPASS allocated 101070 KBytes.
% 0.60/0.80 SPASS spent 0:00:00.43 on the problem.
% 0.60/0.80 0:00:00.04 for the input.
% 0.60/0.80 0:00:00.04 for the FLOTTER CNF translation.
% 0.60/0.80 0:00:00.06 for inferences.
% 0.60/0.80 0:00:00.00 for the backtracking.
% 0.60/0.80 0:00:00.25 for the reduction.
% 0.60/0.80
% 0.60/0.80
% 0.60/0.80 Here is a proof with depth 4, length 20 :
% 0.60/0.80 % SZS output start Refutation
% See solution above
% 0.60/0.81 Formulae used in the proof : dt_k2_yellow_1 fc5_yellow_1 dt_k1_yellow_1 t4_yellow_1 t4_waybel_7 d1_yellow_1 redefinition_m2_relset_1 abstractness_v1_orders_2 free_g1_orders_2
% 0.60/0.81
%------------------------------------------------------------------------------