TSTP Solution File: SEU143+1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : SEU143+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:17 EDT 2022
% Result : Theorem 0.20s 0.44s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 3
% Syntax : Number of clauses : 8 ( 5 unt; 0 nHn; 8 RR)
% Number of literals : 12 ( 0 equ; 8 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 : 6 ( 6 usr; 5 con; 0-1 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(4,axiom,
equal(singleton(skc3),empty_set),
file('SEU143+1.p',unknown),
[] ).
cnf(7,axiom,
( ~ in(u,v)
| ~ equal(v,empty_set) ),
file('SEU143+1.p',unknown),
[] ).
cnf(9,axiom,
( ~ equal(u,v)
| ~ equal(w,singleton(v))
| in(u,w) ),
file('SEU143+1.p',unknown),
[] ).
cnf(12,plain,
~ in(u,singleton(skc3)),
inference(res,[status(thm),theory(equality)],[4,7]),
[iquote('0:Res:4.0,7.0')] ).
cnf(15,plain,
( ~ equal(u,skc3)
| in(u,empty_set) ),
inference(res,[status(thm),theory(equality)],[4,9]),
[iquote('0:Res:4.0,9.1')] ).
cnf(17,plain,
~ in(u,empty_set),
inference(rew,[status(thm),theory(equality)],[4,12]),
[iquote('0:Rew:4.0,12.0')] ).
cnf(18,plain,
~ equal(u,skc3),
inference(mrr,[status(thm)],[15,17]),
[iquote('0:MRR:15.1,17.0')] ).
cnf(21,plain,
$false,
inference(eqr,[status(thm),theory(equality)],[18]),
[iquote('0:EqR:18.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SEU143+1 : TPTP v8.1.0. Released v3.3.0.
% 0.13/0.13 % Command : run_spass %d %s
% 0.13/0.34 % Computer : n004.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Mon Jun 20 09:30:38 EDT 2022
% 0.13/0.34 % 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 6 clauses, backtracked 0 clauses, performed 0 splits and kept 14 clauses.
% 0.20/0.44 SPASS allocated 85209 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 2, length 8 :
% 0.20/0.44 % SZS output start Refutation
% See solution above
% 0.20/0.44 Formulae used in the proof : l1_zfmisc_1 d1_xboole_0 d1_tarski
% 0.20/0.44
%------------------------------------------------------------------------------