TSTP Solution File: SET875+1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : SET875+1 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n007.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 05:29:30 EDT 2022
% Result : Theorem 0.19s 0.44s
% Output : Refutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 3
% Syntax : Number of clauses : 7 ( 4 unt; 0 nHn; 7 RR)
% Number of literals : 11 ( 0 equ; 7 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 4 con; 0-1 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(3,axiom,
disjoint(singleton(skc3),singleton(skc3)),
file('SET875+1.p',unknown),
[] ).
cnf(6,axiom,
( ~ in(u,v)
| ~ disjoint(singleton(u),v) ),
file('SET875+1.p',unknown),
[] ).
cnf(9,axiom,
( ~ equal(u,v)
| ~ equal(w,singleton(v))
| in(u,w) ),
file('SET875+1.p',unknown),
[] ).
cnf(12,plain,
~ in(skc3,singleton(skc3)),
inference(res,[status(thm),theory(equality)],[3,6]),
[iquote('0:Res:3.0,6.0')] ).
cnf(15,plain,
( ~ equal(u,v)
| in(u,singleton(v)) ),
inference(eqr,[status(thm),theory(equality)],[9]),
[iquote('0:EqR:9.1')] ).
cnf(17,plain,
~ equal(skc3,skc3),
inference(res,[status(thm),theory(equality)],[15,12]),
[iquote('0:Res:15.1,12.0')] ).
cnf(20,plain,
$false,
inference(obv,[status(thm),theory(equality)],[17]),
[iquote('0:Obv:17.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SET875+1 : TPTP v8.1.0. Released v3.2.0.
% 0.07/0.13 % Command : run_spass %d %s
% 0.12/0.33 % Computer : n007.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 Jul 11 00:24:17 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.19/0.44
% 0.19/0.44 SPASS V 3.9
% 0.19/0.44 SPASS beiseite: Proof found.
% 0.19/0.44 % SZS status Theorem
% 0.19/0.44 Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.44 SPASS derived 9 clauses, backtracked 0 clauses, performed 0 splits and kept 16 clauses.
% 0.19/0.44 SPASS allocated 85179 KBytes.
% 0.19/0.44 SPASS spent 0:00:00.09 on the problem.
% 0.19/0.44 0:00:00.04 for the input.
% 0.19/0.44 0:00:00.03 for the FLOTTER CNF translation.
% 0.19/0.44 0:00:00.00 for inferences.
% 0.19/0.44 0:00:00.00 for the backtracking.
% 0.19/0.44 0:00:00.00 for the reduction.
% 0.19/0.44
% 0.19/0.44
% 0.19/0.44 Here is a proof with depth 2, length 7 :
% 0.19/0.44 % SZS output start Refutation
% See solution above
% 0.19/0.44 Formulae used in the proof : t16_zfmisc_1 l25_zfmisc_1 d1_tarski antisymmetry_r2_hidden
% 0.19/0.44
%------------------------------------------------------------------------------