TSTP Solution File: SET959+1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : SET959+1 : TPTP v8.1.0. Bugfixed v4.0.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:30:04 EDT 2022
% Result : Theorem 0.20s 0.44s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 7
% Syntax : Number of clauses : 18 ( 5 unt; 2 nHn; 18 RR)
% Number of literals : 35 ( 0 equ; 17 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 4 con; 0-2 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(3,axiom,
~ equal(skc5,skc4),
file('SET959+1.p',unknown),
[] ).
cnf(8,axiom,
( ~ in(u,skc5)
| equal(ordered_pair(skf6(u),skf5(u)),u) ),
file('SET959+1.p',unknown),
[] ).
cnf(9,axiom,
( ~ in(ordered_pair(u,v),skc5)
| in(ordered_pair(u,v),skc4) ),
file('SET959+1.p',unknown),
[] ).
cnf(10,axiom,
( ~ in(ordered_pair(u,v),skc4)
| in(ordered_pair(u,v),skc5) ),
file('SET959+1.p',unknown),
[] ).
cnf(11,axiom,
( ~ in(u,skc4)
| equal(ordered_pair(skf8(u),skf7(u)),u) ),
file('SET959+1.p',unknown),
[] ).
cnf(12,axiom,
( ~ in(skf9(u,v),u)
| ~ in(skf9(u,v),v) ),
file('SET959+1.p',unknown),
[] ).
cnf(13,axiom,
( equal(u,v)
| in(skf9(v,u),v)
| in(skf9(v,u),u) ),
file('SET959+1.p',unknown),
[] ).
cnf(16,plain,
( in(skf9(skc5,skc4),skc5)
| in(skf9(skc5,skc4),skc4) ),
inference(res,[status(thm),theory(equality)],[13,3]),
[iquote('0:Res:13.2,3.0')] ).
cnf(49,plain,
( ~ in(u,skc4)
| ~ in(ordered_pair(skf8(u),skf7(u)),skc4)
| in(u,skc5) ),
inference(spr,[status(thm),theory(equality)],[11,10]),
[iquote('0:SpR:11.1,10.1')] ).
cnf(53,plain,
( ~ in(u,skc4)
| ~ in(u,skc4)
| in(u,skc5) ),
inference(rew,[status(thm),theory(equality)],[11,49]),
[iquote('0:Rew:11.1,49.1')] ).
cnf(54,plain,
( ~ in(u,skc4)
| in(u,skc5) ),
inference(obv,[status(thm),theory(equality)],[53]),
[iquote('0:Obv:53.0')] ).
cnf(55,plain,
in(skf9(skc5,skc4),skc5),
inference(mrr,[status(thm)],[16,54]),
[iquote('0:MRR:16.1,54.0')] ).
cnf(58,plain,
( ~ in(u,skc5)
| ~ in(u,skc5)
| in(ordered_pair(skf6(u),skf5(u)),skc4) ),
inference(spl,[status(thm),theory(equality)],[8,9]),
[iquote('0:SpL:8.1,9.0')] ).
cnf(60,plain,
( ~ in(u,skc5)
| in(ordered_pair(skf6(u),skf5(u)),skc4) ),
inference(obv,[status(thm),theory(equality)],[58]),
[iquote('0:Obv:58.0')] ).
cnf(61,plain,
( ~ in(u,skc5)
| in(u,skc4) ),
inference(rew,[status(thm),theory(equality)],[8,60]),
[iquote('0:Rew:8.1,60.1')] ).
cnf(66,plain,
~ in(skf9(skc5,skc4),skc4),
inference(res,[status(thm),theory(equality)],[55,12]),
[iquote('0:Res:55.0,12.0')] ).
cnf(71,plain,
in(skf9(skc5,skc4),skc4),
inference(res,[status(thm),theory(equality)],[55,61]),
[iquote('0:Res:55.0,61.0')] ).
cnf(73,plain,
$false,
inference(mrr,[status(thm)],[71,66]),
[iquote('0:MRR:71.0,66.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SET959+1 : TPTP v8.1.0. Bugfixed v4.0.0.
% 0.11/0.13 % Command : run_spass %d %s
% 0.12/0.34 % Computer : n007.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Sun Jul 10 16:53:32 EDT 2022
% 0.12/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 48 clauses, backtracked 0 clauses, performed 0 splits and kept 42 clauses.
% 0.20/0.44 SPASS allocated 85124 KBytes.
% 0.20/0.44 SPASS spent 0:00:00.09 on the problem.
% 0.20/0.44 0:00:00.04 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 18 :
% 0.20/0.44 % SZS output start Refutation
% See solution above
% 0.20/0.44 Formulae used in the proof : t112_zfmisc_1 t2_tarski antisymmetry_r2_hidden
% 0.20/0.44
%------------------------------------------------------------------------------