TSTP Solution File: SEU252+1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : SEU252+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n028.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:35:33 EDT 2022
% Result : Theorem 0.45s 0.62s
% Output : Refutation 0.45s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 11
% Syntax : Number of clauses : 28 ( 6 unt; 5 nHn; 28 RR)
% Number of literals : 78 ( 0 equ; 46 neg)
% Maximal clause size : 6 ( 2 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 6 con; 0-2 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
reflexive(skc7),
file('SEU252+1.p',unknown),
[] ).
cnf(2,axiom,
relation(skc7),
file('SEU252+1.p',unknown),
[] ).
cnf(15,axiom,
~ reflexive(relation_restriction(skc7,skc8)),
file('SEU252+1.p',unknown),
[] ).
cnf(26,axiom,
( ~ relation(u)
| relation(relation_restriction(u,v)) ),
file('SEU252+1.p',unknown),
[] ).
cnf(35,axiom,
( ~ relation(u)
| reflexive(u)
| in(skf3(u),relation_field(u)) ),
file('SEU252+1.p',unknown),
[] ).
cnf(42,axiom,
( ~ relation(u)
| ~ in(ordered_pair(skf3(u),skf3(u)),u)
| reflexive(u) ),
file('SEU252+1.p',unknown),
[] ).
cnf(43,axiom,
( ~ relation(u)
| ~ in(v,relation_field(relation_restriction(u,w)))
| in(v,w) ),
file('SEU252+1.p',unknown),
[] ).
cnf(45,axiom,
( ~ relation(u)
| ~ in(v,relation_field(relation_restriction(u,w)))
| in(v,relation_field(u)) ),
file('SEU252+1.p',unknown),
[] ).
cnf(46,axiom,
( ~ in(u,v)
| ~ in(w,x)
| in(ordered_pair(u,w),cartesian_product2(v,x)) ),
file('SEU252+1.p',unknown),
[] ).
cnf(47,axiom,
( ~ relation(u)
| ~ reflexive(u)
| ~ in(v,relation_field(u))
| in(ordered_pair(v,v),u) ),
file('SEU252+1.p',unknown),
[] ).
cnf(48,axiom,
( ~ relation(u)
| ~ in(v,u)
| ~ in(v,cartesian_product2(w,w))
| in(v,relation_restriction(u,w)) ),
file('SEU252+1.p',unknown),
[] ).
cnf(52,plain,
( ~ reflexive(skc7)
| ~ in(u,relation_field(skc7))
| in(ordered_pair(u,u),skc7) ),
inference(res,[status(thm),theory(equality)],[2,47]),
[iquote('0:Res:2.0,47.1')] ).
cnf(54,plain,
( ~ in(u,relation_field(relation_restriction(skc7,v)))
| in(u,relation_field(skc7)) ),
inference(res,[status(thm),theory(equality)],[2,45]),
[iquote('0:Res:2.0,45.0')] ).
cnf(62,plain,
relation(relation_restriction(skc7,u)),
inference(res,[status(thm),theory(equality)],[2,26]),
[iquote('0:Res:2.0,26.0')] ).
cnf(66,plain,
( ~ in(u,relation_field(skc7))
| in(ordered_pair(u,u),skc7) ),
inference(mrr,[status(thm)],[52,1]),
[iquote('0:MRR:52.0,1.0')] ).
cnf(182,plain,
( ~ relation(relation_restriction(skc7,u))
| reflexive(relation_restriction(skc7,u))
| in(skf3(relation_restriction(skc7,u)),relation_field(skc7)) ),
inference(res,[status(thm),theory(equality)],[35,54]),
[iquote('0:Res:35.2,54.0')] ).
cnf(183,plain,
( reflexive(relation_restriction(skc7,u))
| in(skf3(relation_restriction(skc7,u)),relation_field(skc7)) ),
inference(ssi,[status(thm)],[182,62]),
[iquote('0:SSi:182.0,62.0')] ).
cnf(238,plain,
( ~ relation(relation_restriction(u,v))
| ~ relation(u)
| reflexive(relation_restriction(u,v))
| in(skf3(relation_restriction(u,v)),v) ),
inference(res,[status(thm),theory(equality)],[35,43]),
[iquote('0:Res:35.2,43.1')] ).
cnf(240,plain,
( ~ relation(u)
| reflexive(relation_restriction(u,v))
| in(skf3(relation_restriction(u,v)),v) ),
inference(ssi,[status(thm)],[238,26]),
[iquote('0:SSi:238.0,26.1')] ).
cnf(400,plain,
( ~ relation(u)
| ~ in(v,w)
| ~ in(x,w)
| ~ in(ordered_pair(v,x),u)
| in(ordered_pair(v,x),relation_restriction(u,w)) ),
inference(res,[status(thm),theory(equality)],[46,48]),
[iquote('0:Res:46.2,48.2')] ).
cnf(1186,plain,
( ~ relation(u)
| ~ relation(relation_restriction(u,v))
| ~ in(skf3(relation_restriction(u,v)),v)
| ~ in(skf3(relation_restriction(u,v)),v)
| ~ in(ordered_pair(skf3(relation_restriction(u,v)),skf3(relation_restriction(u,v))),u)
| reflexive(relation_restriction(u,v)) ),
inference(res,[status(thm),theory(equality)],[400,42]),
[iquote('0:Res:400.4,42.1')] ).
cnf(1196,plain,
( ~ relation(u)
| ~ relation(relation_restriction(u,v))
| ~ in(skf3(relation_restriction(u,v)),v)
| ~ in(ordered_pair(skf3(relation_restriction(u,v)),skf3(relation_restriction(u,v))),u)
| reflexive(relation_restriction(u,v)) ),
inference(obv,[status(thm),theory(equality)],[1186]),
[iquote('0:Obv:1186.2')] ).
cnf(1197,plain,
( ~ relation(u)
| ~ in(skf3(relation_restriction(u,v)),v)
| ~ in(ordered_pair(skf3(relation_restriction(u,v)),skf3(relation_restriction(u,v))),u)
| reflexive(relation_restriction(u,v)) ),
inference(ssi,[status(thm)],[1196,26]),
[iquote('0:SSi:1196.1,26.1')] ).
cnf(1198,plain,
( ~ relation(u)
| ~ in(ordered_pair(skf3(relation_restriction(u,v)),skf3(relation_restriction(u,v))),u)
| reflexive(relation_restriction(u,v)) ),
inference(mrr,[status(thm)],[1197,240]),
[iquote('0:MRR:1197.1,240.2')] ).
cnf(2333,plain,
( ~ relation(skc7)
| ~ in(skf3(relation_restriction(skc7,u)),relation_field(skc7))
| reflexive(relation_restriction(skc7,u)) ),
inference(res,[status(thm),theory(equality)],[66,1198]),
[iquote('0:Res:66.1,1198.1')] ).
cnf(2336,plain,
( ~ in(skf3(relation_restriction(skc7,u)),relation_field(skc7))
| reflexive(relation_restriction(skc7,u)) ),
inference(ssi,[status(thm)],[2333,1,2]),
[iquote('0:SSi:2333.0,1.0,2.0')] ).
cnf(2337,plain,
reflexive(relation_restriction(skc7,u)),
inference(mrr,[status(thm)],[2336,183]),
[iquote('0:MRR:2336.0,183.1')] ).
cnf(2338,plain,
$false,
inference(unc,[status(thm)],[2337,15]),
[iquote('0:UnC:2337.0,15.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.11 % Problem : SEU252+1 : TPTP v8.1.0. Released v3.3.0.
% 0.11/0.12 % Command : run_spass %d %s
% 0.11/0.32 % Computer : n028.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 300
% 0.11/0.32 % WCLimit : 600
% 0.11/0.32 % DateTime : Sat Jun 18 22:20:14 EDT 2022
% 0.11/0.33 % CPUTime :
% 0.45/0.62
% 0.45/0.62 SPASS V 3.9
% 0.45/0.62 SPASS beiseite: Proof found.
% 0.45/0.62 % SZS status Theorem
% 0.45/0.62 Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.45/0.62 SPASS derived 1647 clauses, backtracked 0 clauses, performed 0 splits and kept 471 clauses.
% 0.45/0.62 SPASS allocated 99849 KBytes.
% 0.45/0.62 SPASS spent 0:00:00.26 on the problem.
% 0.45/0.62 0:00:00.03 for the input.
% 0.45/0.62 0:00:00.03 for the FLOTTER CNF translation.
% 0.45/0.62 0:00:00.03 for inferences.
% 0.45/0.62 0:00:00.00 for the backtracking.
% 0.45/0.62 0:00:00.14 for the reduction.
% 0.45/0.62
% 0.45/0.62
% 0.45/0.62 Here is a proof with depth 3, length 28 :
% 0.45/0.62 % SZS output start Refutation
% See solution above
% 0.45/0.62 Formulae used in the proof : t22_wellord1 dt_k2_wellord1 l1_wellord1 t19_wellord1 t106_zfmisc_1 t16_wellord1
% 0.45/0.62
%------------------------------------------------------------------------------