TSTP Solution File: SEU189+1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : SEU189+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n029.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:50 EDT 2022
% Result : Theorem 0.20s 0.44s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 7
% Syntax : Number of clauses : 25 ( 13 unt; 1 nHn; 25 RR)
% Number of literals : 39 ( 0 equ; 19 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-1 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
relation(skc5),
file('SEU189+1.p',unknown),
[] ).
cnf(12,axiom,
equal(relation_dom(empty_set),empty_set),
file('SEU189+1.p',unknown),
[] ).
cnf(13,axiom,
equal(relation_rng(empty_set),empty_set),
file('SEU189+1.p',unknown),
[] ).
cnf(22,axiom,
( equal(relation_rng(skc5),empty_set)
| equal(relation_dom(skc5),empty_set) ),
file('SEU189+1.p',unknown),
[] ).
cnf(28,axiom,
( ~ equal(relation_dom(skc5),empty_set)
| ~ equal(relation_rng(skc5),empty_set) ),
file('SEU189+1.p',unknown),
[] ).
cnf(29,axiom,
( ~ relation(u)
| ~ equal(relation_dom(u),empty_set)
| equal(u,empty_set) ),
file('SEU189+1.p',unknown),
[] ).
cnf(30,axiom,
( ~ relation(u)
| ~ equal(relation_rng(u),empty_set)
| equal(u,empty_set) ),
file('SEU189+1.p',unknown),
[] ).
cnf(31,plain,
( ~ equal(relation_dom(skc5),empty_set)
| equal(empty_set,skc5) ),
inference(res,[status(thm),theory(equality)],[1,29]),
[iquote('0:Res:1.0,29.0')] ).
cnf(32,plain,
( ~ equal(relation_rng(skc5),empty_set)
| equal(empty_set,skc5) ),
inference(res,[status(thm),theory(equality)],[1,30]),
[iquote('0:Res:1.0,30.0')] ).
cnf(35,plain,
( ~ equal(relation_rng(skc5),skc5)
| ~ equal(relation_dom(skc5),empty_set) ),
inference(rew,[status(thm),theory(equality)],[31,28]),
[iquote('0:Rew:31.1,28.1')] ).
cnf(36,plain,
equal(relation_rng(skc5),empty_set),
inference(spt,[spt(split,[position(s1)])],[22]),
[iquote('1:Spt:22.0')] ).
cnf(37,plain,
( ~ equal(empty_set,empty_set)
| equal(empty_set,skc5) ),
inference(rew,[status(thm),theory(equality)],[36,32]),
[iquote('1:Rew:36.0,32.0')] ).
cnf(39,plain,
( ~ equal(empty_set,skc5)
| ~ equal(relation_dom(skc5),empty_set) ),
inference(rew,[status(thm),theory(equality)],[36,35]),
[iquote('1:Rew:36.0,35.0')] ).
cnf(41,plain,
equal(empty_set,skc5),
inference(obv,[status(thm),theory(equality)],[37]),
[iquote('1:Obv:37.0')] ).
cnf(48,plain,
equal(relation_dom(skc5),skc5),
inference(rew,[status(thm),theory(equality)],[41,12]),
[iquote('1:Rew:41.0,12.0')] ).
cnf(50,plain,
( ~ equal(skc5,skc5)
| ~ equal(skc5,skc5) ),
inference(rew,[status(thm),theory(equality)],[48,39,41]),
[iquote('1:Rew:48.0,39.1,41.0,39.1,41.0,39.0')] ).
cnf(51,plain,
$false,
inference(obv,[status(thm),theory(equality)],[50]),
[iquote('1:Obv:50.1')] ).
cnf(54,plain,
~ equal(relation_rng(skc5),empty_set),
inference(spt,[spt(split,[position(sa)])],[51,36]),
[iquote('1:Spt:51.0,22.0,36.0')] ).
cnf(55,plain,
equal(relation_dom(skc5),empty_set),
inference(spt,[spt(split,[position(s2)])],[22]),
[iquote('1:Spt:51.0,22.1')] ).
cnf(58,plain,
( ~ equal(empty_set,empty_set)
| equal(empty_set,skc5) ),
inference(rew,[status(thm),theory(equality)],[55,31]),
[iquote('1:Rew:55.0,31.0')] ).
cnf(59,plain,
equal(empty_set,skc5),
inference(obv,[status(thm),theory(equality)],[58]),
[iquote('1:Obv:58.0')] ).
cnf(62,plain,
equal(relation_dom(skc5),skc5),
inference(rew,[status(thm),theory(equality)],[59,12]),
[iquote('1:Rew:59.0,12.0')] ).
cnf(63,plain,
equal(relation_rng(skc5),skc5),
inference(rew,[status(thm),theory(equality)],[59,13]),
[iquote('1:Rew:59.0,13.0')] ).
cnf(69,plain,
( ~ equal(skc5,skc5)
| ~ equal(skc5,skc5) ),
inference(rew,[status(thm),theory(equality)],[62,35,59,63]),
[iquote('1:Rew:62.0,35.1,59.0,35.1,63.0,35.0')] ).
cnf(70,plain,
$false,
inference(obv,[status(thm),theory(equality)],[69]),
[iquote('1:Obv:69.1')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SEU189+1 : TPTP v8.1.0. Released v3.3.0.
% 0.07/0.13 % Command : run_spass %d %s
% 0.14/0.34 % Computer : n029.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 600
% 0.14/0.34 % DateTime : Mon Jun 20 11:28:15 EDT 2022
% 0.14/0.35 % CPUTime :
% 0.20/0.44
% 0.20/0.44 SPASS V 3.9
% 0.20/0.44 SPASS beiseite: Proof found.
% 0.20/0.44 % SZS status Theorem
% 0.20/0.44 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.44 SPASS derived 24 clauses, backtracked 14 clauses, performed 1 splits and kept 60 clauses.
% 0.20/0.44 SPASS allocated 97652 KBytes.
% 0.20/0.44 SPASS spent 0:00:00.09 on the problem.
% 0.20/0.44 0:00:00.03 for the input.
% 0.20/0.44 0:00:00.03 for the FLOTTER CNF translation.
% 0.20/0.44 0:00:00.00 for inferences.
% 0.20/0.44 0:00:00.00 for the backtracking.
% 0.20/0.44 0:00:00.00 for the reduction.
% 0.20/0.44
% 0.20/0.44
% 0.20/0.44 Here is a proof with depth 1, length 25 :
% 0.20/0.44 % SZS output start Refutation
% See solution above
% 0.20/0.45 Formulae used in the proof : t65_relat_1 t60_relat_1 t64_relat_1
% 0.20/0.45
%------------------------------------------------------------------------------