TSTP Solution File: SET884+1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : SET884+1 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n012.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:34 EDT 2022
% Result : Theorem 0.19s 0.45s
% Output : Refutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 7
% Syntax : Number of clauses : 17 ( 9 unt; 1 nHn; 17 RR)
% Number of literals : 30 ( 0 equ; 19 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 3 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(4,axiom,
~ equal(skc7,skc5),
file('SET884+1.p',unknown),
[] ).
cnf(5,axiom,
~ equal(skc6,skc5),
file('SET884+1.p',unknown),
[] ).
cnf(6,axiom,
subset(singleton(skc5),unordered_pair(skc7,skc6)),
file('SET884+1.p',unknown),
[] ).
cnf(7,axiom,
equal(unordered_pair(u,v),unordered_pair(v,u)),
file('SET884+1.p',unknown),
[] ).
cnf(11,axiom,
( ~ in(u,v)
| ~ subset(v,w)
| in(u,w) ),
file('SET884+1.p',unknown),
[] ).
cnf(13,axiom,
( ~ equal(u,v)
| ~ equal(w,singleton(v))
| in(u,w) ),
file('SET884+1.p',unknown),
[] ).
cnf(18,axiom,
( ~ in(u,v)
| ~ equal(v,unordered_pair(w,x))
| equal(u,x)
| equal(u,w) ),
file('SET884+1.p',unknown),
[] ).
cnf(22,plain,
subset(singleton(skc5),unordered_pair(skc6,skc7)),
inference(rew,[status(thm),theory(equality)],[7,6]),
[iquote('0:Rew:7.0,6.0')] ).
cnf(28,plain,
( ~ equal(u,unordered_pair(v,skc6))
| ~ in(skc5,u)
| equal(skc5,v) ),
inference(res,[status(thm),theory(equality)],[18,5]),
[iquote('0:Res:18.3,5.0')] ).
cnf(35,plain,
( ~ in(u,singleton(skc5))
| in(u,unordered_pair(skc6,skc7)) ),
inference(res,[status(thm),theory(equality)],[22,11]),
[iquote('0:Res:22.0,11.0')] ).
cnf(40,plain,
( ~ in(skc5,u)
| ~ equal(u,unordered_pair(skc7,skc6)) ),
inference(res,[status(thm),theory(equality)],[28,4]),
[iquote('0:Res:28.2,4.0')] ).
cnf(48,plain,
( ~ equal(u,unordered_pair(skc6,skc7))
| ~ in(skc5,u) ),
inference(rew,[status(thm),theory(equality)],[7,40]),
[iquote('0:Rew:7.0,40.1')] ).
cnf(65,plain,
~ in(skc5,unordered_pair(skc6,skc7)),
inference(eqr,[status(thm),theory(equality)],[48]),
[iquote('0:EqR:48.0')] ).
cnf(66,plain,
~ in(skc5,singleton(skc5)),
inference(res,[status(thm),theory(equality)],[35,65]),
[iquote('0:Res:35.1,65.0')] ).
cnf(67,plain,
( ~ equal(u,v)
| in(u,singleton(v)) ),
inference(eqr,[status(thm),theory(equality)],[13]),
[iquote('0:EqR:13.1')] ).
cnf(75,plain,
~ equal(skc5,skc5),
inference(res,[status(thm),theory(equality)],[67,66]),
[iquote('0:Res:67.1,66.0')] ).
cnf(76,plain,
$false,
inference(obv,[status(thm),theory(equality)],[75]),
[iquote('0:Obv:75.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SET884+1 : TPTP v8.1.0. Released v3.2.0.
% 0.07/0.13 % Command : run_spass %d %s
% 0.13/0.33 % Computer : n012.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 600
% 0.13/0.33 % DateTime : Mon Jul 11 06:41:43 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.19/0.45
% 0.19/0.45 SPASS V 3.9
% 0.19/0.45 SPASS beiseite: Proof found.
% 0.19/0.45 % SZS status Theorem
% 0.19/0.45 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.45 SPASS derived 51 clauses, backtracked 0 clauses, performed 0 splits and kept 60 clauses.
% 0.19/0.45 SPASS allocated 85522 KBytes.
% 0.19/0.45 SPASS spent 0:00:00.10 on the problem.
% 0.19/0.45 0:00:00.04 for the input.
% 0.19/0.45 0:00:00.04 for the FLOTTER CNF translation.
% 0.19/0.45 0:00:00.00 for inferences.
% 0.19/0.45 0:00:00.00 for the backtracking.
% 0.19/0.45 0:00:00.00 for the reduction.
% 0.19/0.45
% 0.19/0.45
% 0.19/0.45 Here is a proof with depth 5, length 17 :
% 0.19/0.45 % SZS output start Refutation
% See solution above
% 0.19/0.45 Formulae used in the proof : t25_zfmisc_1 commutativity_k2_tarski d3_tarski d1_tarski d2_tarski
% 0.19/0.45
%------------------------------------------------------------------------------