TSTP Solution File: SEU198+1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : SEU198+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n032.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:55 EDT 2022
% Result : Theorem 0.15s 0.42s
% Output : Refutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 5
% Syntax : Number of clauses : 10 ( 4 unt; 3 nHn; 10 RR)
% Number of literals : 19 ( 0 equ; 8 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 5 con; 0-2 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
relation(skc6),
file('SEU198+1.p',unknown),
[] ).
cnf(22,axiom,
~ subset(relation_rng(relation_rng_restriction(skc7,skc6)),skc7),
file('SEU198+1.p',unknown),
[] ).
cnf(27,axiom,
( subset(u,v)
| in(skf4(v,u),u) ),
file('SEU198+1.p',unknown),
[] ).
cnf(30,axiom,
( ~ in(skf4(u,v),u)
| subset(w,u) ),
file('SEU198+1.p',unknown),
[] ).
cnf(37,axiom,
( ~ relation(u)
| ~ in(v,relation_rng(relation_rng_restriction(w,u)))
| in(v,w) ),
file('SEU198+1.p',unknown),
[] ).
cnf(166,plain,
( ~ relation(u)
| subset(relation_rng(relation_rng_restriction(v,u)),w)
| in(skf4(w,relation_rng(relation_rng_restriction(v,u))),v) ),
inference(res,[status(thm),theory(equality)],[27,37]),
[iquote('0:Res:27.1,37.1')] ).
cnf(633,plain,
( ~ relation(u)
| subset(relation_rng(relation_rng_restriction(v,u)),v)
| subset(w,v) ),
inference(res,[status(thm),theory(equality)],[166,30]),
[iquote('0:Res:166.2,30.0')] ).
cnf(647,plain,
( ~ relation(u)
| subset(relation_rng(relation_rng_restriction(v,u)),v) ),
inference(con,[status(thm)],[633]),
[iquote('0:Con:633.2')] ).
cnf(854,plain,
~ relation(skc6),
inference(res,[status(thm),theory(equality)],[647,22]),
[iquote('0:Res:647.1,22.0')] ).
cnf(858,plain,
$false,
inference(ssi,[status(thm)],[854,1]),
[iquote('0:SSi:854.0,1.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.10 % Problem : SEU198+1 : TPTP v8.1.0. Released v3.3.0.
% 0.02/0.10 % Command : run_spass %d %s
% 0.10/0.30 % Computer : n032.cluster.edu
% 0.10/0.30 % Model : x86_64 x86_64
% 0.10/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.30 % Memory : 8042.1875MB
% 0.10/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.30 % CPULimit : 300
% 0.10/0.30 % WCLimit : 600
% 0.10/0.30 % DateTime : Sun Jun 19 21:22:03 EDT 2022
% 0.10/0.30 % CPUTime :
% 0.15/0.42
% 0.15/0.42 SPASS V 3.9
% 0.15/0.42 SPASS beiseite: Proof found.
% 0.15/0.42 % SZS status Theorem
% 0.15/0.42 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.15/0.42 SPASS derived 697 clauses, backtracked 24 clauses, performed 1 splits and kept 340 clauses.
% 0.15/0.42 SPASS allocated 98199 KBytes.
% 0.15/0.42 SPASS spent 0:00:00.11 on the problem.
% 0.15/0.42 0:00:00.03 for the input.
% 0.15/0.42 0:00:00.02 for the FLOTTER CNF translation.
% 0.15/0.42 0:00:00.01 for inferences.
% 0.15/0.42 0:00:00.00 for the backtracking.
% 0.15/0.42 0:00:00.03 for the reduction.
% 0.15/0.42
% 0.15/0.42
% 0.15/0.42 Here is a proof with depth 3, length 10 :
% 0.15/0.42 % SZS output start Refutation
% See solution above
% 0.15/0.42 Formulae used in the proof : t116_relat_1 d3_tarski t115_relat_1
% 0.15/0.42
%------------------------------------------------------------------------------