TSTP Solution File: SEU149+1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : SEU149+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n004.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:22 EDT 2022
% Result : Theorem 0.18s 0.44s
% Output : Refutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 4
% Syntax : Number of clauses : 10 ( 5 unt; 0 nHn; 10 RR)
% Number of literals : 17 ( 0 equ; 10 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 : 9 ( 9 usr; 7 con; 0-2 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
~ equal(skc4,skc3),
file('SEU149+1.p',unknown),
[] ).
cnf(2,axiom,
equal(unordered_pair(skc4,skc5),singleton(skc3)),
file('SEU149+1.p',unknown),
[] ).
cnf(6,axiom,
( ~ in(u,v)
| ~ equal(v,singleton(w))
| equal(u,w) ),
file('SEU149+1.p',unknown),
[] ).
cnf(8,axiom,
( ~ equal(u,v)
| ~ equal(w,unordered_pair(v,x))
| in(u,w) ),
file('SEU149+1.p',unknown),
[] ).
cnf(25,plain,
( ~ in(u,unordered_pair(skc4,skc5))
| equal(u,skc3) ),
inference(res,[status(thm),theory(equality)],[2,6]),
[iquote('0:Res:2.0,6.1')] ).
cnf(30,plain,
( ~ equal(u,skc4)
| in(u,singleton(skc3)) ),
inference(res,[status(thm),theory(equality)],[2,8]),
[iquote('0:Res:2.0,8.1')] ).
cnf(33,plain,
( ~ in(u,singleton(skc3))
| equal(u,skc3) ),
inference(rew,[status(thm),theory(equality)],[2,25]),
[iquote('0:Rew:2.0,25.0')] ).
cnf(34,plain,
~ in(skc4,singleton(skc3)),
inference(res,[status(thm),theory(equality)],[33,1]),
[iquote('0:Res:33.1,1.0')] ).
cnf(45,plain,
~ equal(skc4,skc4),
inference(res,[status(thm),theory(equality)],[30,34]),
[iquote('0:Res:30.1,34.0')] ).
cnf(48,plain,
$false,
inference(obv,[status(thm),theory(equality)],[45]),
[iquote('0:Obv:45.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.11 % Problem : SEU149+1 : TPTP v8.1.0. Released v3.3.0.
% 0.09/0.12 % Command : run_spass %d %s
% 0.12/0.33 % Computer : n004.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Mon Jun 20 01:53:53 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.18/0.44
% 0.18/0.44 SPASS V 3.9
% 0.18/0.44 SPASS beiseite: Proof found.
% 0.18/0.44 % SZS status Theorem
% 0.18/0.44 Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.18/0.44 SPASS derived 25 clauses, backtracked 0 clauses, performed 0 splits and kept 31 clauses.
% 0.18/0.44 SPASS allocated 85347 KBytes.
% 0.18/0.44 SPASS spent 0:00:00.10 on the problem.
% 0.18/0.44 0:00:00.03 for the input.
% 0.18/0.44 0:00:00.04 for the FLOTTER CNF translation.
% 0.18/0.44 0:00:00.00 for inferences.
% 0.18/0.44 0:00:00.00 for the backtracking.
% 0.18/0.44 0:00:00.00 for the reduction.
% 0.18/0.44
% 0.18/0.44
% 0.18/0.44 Here is a proof with depth 3, length 10 :
% 0.18/0.44 % SZS output start Refutation
% See solution above
% 0.18/0.44 Formulae used in the proof : t8_zfmisc_1 d1_tarski antisymmetry_r2_hidden d2_tarski
% 0.18/0.44
%------------------------------------------------------------------------------