TSTP Solution File: SET958+1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : SET958+1 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n006.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:30:04 EDT 2022
% Result : Theorem 0.18s 0.43s
% Output : Refutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 5
% Syntax : Number of clauses : 12 ( 5 unt; 1 nHn; 12 RR)
% Number of literals : 21 ( 0 equ; 11 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 5 con; 0-2 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(4,axiom,
~ subset(skc4,skc5),
file('SET958+1.p',unknown),
[] ).
cnf(8,axiom,
( subset(u,v)
| in(skf5(v,u),u) ),
file('SET958+1.p',unknown),
[] ).
cnf(9,axiom,
( ~ in(skf5(u,v),u)
| subset(w,u) ),
file('SET958+1.p',unknown),
[] ).
cnf(11,axiom,
( ~ in(ordered_pair(u,v),skc4)
| in(ordered_pair(u,v),skc5) ),
file('SET958+1.p',unknown),
[] ).
cnf(12,axiom,
( ~ in(u,skc4)
| equal(ordered_pair(skf4(u),skf3(u)),u) ),
file('SET958+1.p',unknown),
[] ).
cnf(15,plain,
in(skf5(skc5,skc4),skc4),
inference(res,[status(thm),theory(equality)],[8,4]),
[iquote('0:Res:8.1,4.0')] ).
cnf(16,plain,
~ in(skf5(skc5,u),skc5),
inference(res,[status(thm),theory(equality)],[9,4]),
[iquote('0:Res:9.1,4.0')] ).
cnf(45,plain,
( ~ in(u,skc4)
| ~ in(ordered_pair(skf4(u),skf3(u)),skc4)
| in(u,skc5) ),
inference(spr,[status(thm),theory(equality)],[12,11]),
[iquote('0:SpR:12.1,11.1')] ).
cnf(47,plain,
( ~ in(u,skc4)
| ~ in(u,skc4)
| in(u,skc5) ),
inference(rew,[status(thm),theory(equality)],[12,45]),
[iquote('0:Rew:12.1,45.1')] ).
cnf(48,plain,
( ~ in(u,skc4)
| in(u,skc5) ),
inference(obv,[status(thm),theory(equality)],[47]),
[iquote('0:Obv:47.0')] ).
cnf(49,plain,
~ in(skf5(skc5,u),skc4),
inference(res,[status(thm),theory(equality)],[48,16]),
[iquote('0:Res:48.1,16.0')] ).
cnf(52,plain,
$false,
inference(unc,[status(thm)],[49,15]),
[iquote('0:UnC:49.0,15.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : SET958+1 : TPTP v8.1.0. Released v3.2.0.
% 0.06/0.12 % Command : run_spass %d %s
% 0.13/0.33 % Computer : n006.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 08:05:35 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.18/0.43
% 0.18/0.43 SPASS V 3.9
% 0.18/0.43 SPASS beiseite: Proof found.
% 0.18/0.43 % SZS status Theorem
% 0.18/0.43 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.18/0.43 SPASS derived 30 clauses, backtracked 0 clauses, performed 0 splits and kept 30 clauses.
% 0.18/0.43 SPASS allocated 85209 KBytes.
% 0.18/0.43 SPASS spent 0:00:00.09 on the problem.
% 0.18/0.43 0:00:00.03 for the input.
% 0.18/0.43 0:00:00.03 for the FLOTTER CNF translation.
% 0.18/0.43 0:00:00.00 for inferences.
% 0.18/0.43 0:00:00.00 for the backtracking.
% 0.18/0.43 0:00:00.00 for the reduction.
% 0.18/0.43
% 0.18/0.43
% 0.18/0.43 Here is a proof with depth 2, length 12 :
% 0.18/0.43 % SZS output start Refutation
% See solution above
% 0.18/0.43 Formulae used in the proof : t111_zfmisc_1 d3_tarski
% 0.18/0.43
%------------------------------------------------------------------------------