TSTP Solution File: SET988+1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : SET988+1 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n022.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:15 EDT 2022
% Result : Theorem 0.18s 0.46s
% Output : Refutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 8
% Syntax : Number of clauses : 17 ( 4 unt; 6 nHn; 17 RR)
% Number of literals : 33 ( 0 equ; 13 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 12 ( 12 usr; 5 con; 0-2 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(28,axiom,
( ~ function(skc7)
| ~ relation(skc7) ),
file('SET988+1.p',unknown),
[] ).
cnf(31,axiom,
~ equal(skf17(u),skf16(u)),
file('SET988+1.p',unknown),
[] ).
cnf(32,axiom,
( relation(u)
| in(skf23(u),u) ),
file('SET988+1.p',unknown),
[] ).
cnf(41,axiom,
( function(u)
| in(ordered_pair(skf18(u),skf16(u)),u) ),
file('SET988+1.p',unknown),
[] ).
cnf(42,axiom,
( function(u)
| in(ordered_pair(skf18(u),skf17(u)),u) ),
file('SET988+1.p',unknown),
[] ).
cnf(43,axiom,
( ~ equal(skf23(u),ordered_pair(v,w))
| relation(x) ),
file('SET988+1.p',unknown),
[] ).
cnf(45,axiom,
( ~ in(u,skc7)
| equal(ordered_pair(skf12(u),skf11(u)),u) ),
file('SET988+1.p',unknown),
[] ).
cnf(49,axiom,
( ~ in(ordered_pair(u,v),skc7)
| ~ in(ordered_pair(u,w),skc7)
| equal(w,v) ),
file('SET988+1.p',unknown),
[] ).
cnf(106,plain,
( ~ in(u,skc7)
| ~ equal(skf23(v),u)
| relation(w) ),
inference(spl,[status(thm),theory(equality)],[45,43]),
[iquote('0:SpL:45.1,43.0')] ).
cnf(156,plain,
( ~ in(ordered_pair(skf18(skc7),u),skc7)
| function(skc7)
| equal(u,skf17(skc7)) ),
inference(res,[status(thm),theory(equality)],[42,49]),
[iquote('0:Res:42.1,49.0')] ).
cnf(189,plain,
( ~ in(skf23(u),skc7)
| relation(v) ),
inference(eqr,[status(thm),theory(equality)],[106]),
[iquote('0:EqR:106.1')] ).
cnf(190,plain,
( relation(skc7)
| relation(u) ),
inference(res,[status(thm),theory(equality)],[32,189]),
[iquote('0:Res:32.1,189.0')] ).
cnf(192,plain,
relation(skc7),
inference(con,[status(thm)],[190]),
[iquote('0:Con:190.1')] ).
cnf(193,plain,
~ function(skc7),
inference(mrr,[status(thm)],[28,192]),
[iquote('0:MRR:28.1,192.0')] ).
cnf(194,plain,
( ~ in(ordered_pair(skf18(skc7),u),skc7)
| equal(u,skf17(skc7)) ),
inference(mrr,[status(thm)],[156,193]),
[iquote('0:MRR:156.1,193.0')] ).
cnf(205,plain,
( function(skc7)
| equal(skf17(skc7),skf16(skc7)) ),
inference(res,[status(thm),theory(equality)],[41,194]),
[iquote('0:Res:41.1,194.0')] ).
cnf(207,plain,
$false,
inference(mrr,[status(thm)],[205,193,31]),
[iquote('0:MRR:205.0,205.1,193.0,31.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SET988+1 : TPTP v8.1.0. Released v3.2.0.
% 0.07/0.13 % Command : run_spass %d %s
% 0.13/0.33 % Computer : n022.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 : Sun Jul 10 15:07:25 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.18/0.46
% 0.18/0.46 SPASS V 3.9
% 0.18/0.46 SPASS beiseite: Proof found.
% 0.18/0.46 % SZS status Theorem
% 0.18/0.46 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.18/0.46 SPASS derived 138 clauses, backtracked 0 clauses, performed 0 splits and kept 135 clauses.
% 0.18/0.46 SPASS allocated 97846 KBytes.
% 0.18/0.46 SPASS spent 0:00:00.11 on the problem.
% 0.18/0.46 0:00:00.03 for the input.
% 0.18/0.46 0:00:00.03 for the FLOTTER CNF translation.
% 0.18/0.46 0:00:00.00 for inferences.
% 0.18/0.46 0:00:00.00 for the backtracking.
% 0.18/0.46 0:00:00.01 for the reduction.
% 0.18/0.46
% 0.18/0.46
% 0.18/0.46 Here is a proof with depth 3, length 17 :
% 0.18/0.46 % SZS output start Refutation
% See solution above
% 0.18/0.46 Formulae used in the proof : t2_funct_1 d1_funct_1 d1_relat_1
% 0.18/0.46
%------------------------------------------------------------------------------