TSTP Solution File: SEU204+1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : SEU204+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n005.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:34:58 EDT 2022
% Result : Theorem 157.91s 158.10s
% Output : Refutation 157.91s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 6
% Syntax : Number of clauses : 15 ( 4 unt; 3 nHn; 15 RR)
% Number of literals : 37 ( 0 equ; 21 neg)
% Maximal clause size : 4 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 6 con; 0-3 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
relation(skc6),
file('SEU204+1.p',unknown),
[] ).
cnf(25,axiom,
~ subset(relation_image(skc6,skc7),relation_rng(skc6)),
file('SEU204+1.p',unknown),
[] ).
cnf(30,axiom,
( subset(u,v)
| in(skf14(v,u),u) ),
file('SEU204+1.p',unknown),
[] ).
cnf(33,axiom,
( ~ in(skf14(u,v),u)
| subset(w,u) ),
file('SEU204+1.p',unknown),
[] ).
cnf(41,axiom,
( ~ relation(u)
| ~ equal(v,relation_rng(u))
| ~ in(ordered_pair(w,x),u)
| in(x,v) ),
file('SEU204+1.p',unknown),
[] ).
cnf(47,axiom,
( ~ relation(u)
| ~ in(v,w)
| ~ equal(w,relation_image(u,x))
| in(ordered_pair(skf10(x,u,v),v),u) ),
file('SEU204+1.p',unknown),
[] ).
cnf(61,plain,
( ~ equal(u,relation_rng(skc6))
| ~ in(ordered_pair(v,w),skc6)
| in(w,u) ),
inference(res,[status(thm),theory(equality)],[1,41]),
[iquote('0:Res:1.0,41.0')] ).
cnf(411,plain,
( ~ relation(u)
| ~ in(v,relation_image(u,w))
| in(ordered_pair(skf10(w,u,v),v),u) ),
inference(eqr,[status(thm),theory(equality)],[47]),
[iquote('0:EqR:47.2')] ).
cnf(1295,plain,
( ~ relation(skc6)
| ~ in(u,relation_image(skc6,v))
| ~ equal(w,relation_rng(skc6))
| in(u,w) ),
inference(res,[status(thm),theory(equality)],[411,61]),
[iquote('0:Res:411.2,61.1')] ).
cnf(1298,plain,
( ~ in(u,relation_image(skc6,v))
| ~ equal(w,relation_rng(skc6))
| in(u,w) ),
inference(ssi,[status(thm)],[1295,1]),
[iquote('0:SSi:1295.0,1.0')] ).
cnf(4423,plain,
( ~ equal(u,relation_rng(skc6))
| subset(relation_image(skc6,v),w)
| in(skf14(w,relation_image(skc6,v)),u) ),
inference(res,[status(thm),theory(equality)],[30,1298]),
[iquote('0:Res:30.1,1298.0')] ).
cnf(48298,plain,
( ~ equal(u,relation_rng(skc6))
| subset(relation_image(skc6,v),u)
| subset(w,u) ),
inference(res,[status(thm),theory(equality)],[4423,33]),
[iquote('0:Res:4423.2,33.0')] ).
cnf(48411,plain,
( ~ equal(u,relation_rng(skc6))
| subset(relation_image(skc6,v),u) ),
inference(con,[status(thm)],[48298]),
[iquote('0:Con:48298.2')] ).
cnf(48476,plain,
~ equal(relation_rng(skc6),relation_rng(skc6)),
inference(res,[status(thm),theory(equality)],[48411,25]),
[iquote('0:Res:48411.1,25.0')] ).
cnf(48495,plain,
$false,
inference(obv,[status(thm),theory(equality)],[48476]),
[iquote('0:Obv:48476.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SEU204+1 : TPTP v8.1.0. Released v3.3.0.
% 0.07/0.13 % Command : run_spass %d %s
% 0.12/0.34 % Computer : n005.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 01:58:23 EDT 2022
% 0.12/0.34 % CPUTime :
% 157.91/158.10
% 157.91/158.10 SPASS V 3.9
% 157.91/158.10 SPASS beiseite: Proof found.
% 157.91/158.10 % SZS status Theorem
% 157.91/158.10 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 157.91/158.10 SPASS derived 39085 clauses, backtracked 866 clauses, performed 9 splits and kept 17676 clauses.
% 157.91/158.10 SPASS allocated 144445 KBytes.
% 157.91/158.10 SPASS spent 0:2:35.06 on the problem.
% 157.91/158.10 0:00:00.03 for the input.
% 157.91/158.10 0:00:00.08 for the FLOTTER CNF translation.
% 157.91/158.10 0:00:00.68 for inferences.
% 157.91/158.10 0:00:02.01 for the backtracking.
% 157.91/158.10 0:2:31.73 for the reduction.
% 157.91/158.10
% 157.91/158.10
% 157.91/158.10 Here is a proof with depth 5, length 15 :
% 157.91/158.10 % SZS output start Refutation
% See solution above
% 157.91/158.10 Formulae used in the proof : t144_relat_1 d3_tarski d5_relat_1 d13_relat_1
% 157.91/158.10
%------------------------------------------------------------------------------