TSTP Solution File: SET901+1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : SET901+1 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n003.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:40 EDT 2022
% Result : Theorem 0.17s 0.43s
% Output : Refutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 10
% Syntax : Number of clauses : 17 ( 6 unt; 3 nHn; 17 RR)
% Number of literals : 36 ( 0 equ; 17 neg)
% Maximal clause size : 5 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 2 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(6,axiom,
( ~ equal(u,empty_set)
| subset(u,unordered_pair(v,w)) ),
file('SET901+1.p',unknown),
[] ).
cnf(7,axiom,
( ~ equal(skc5,empty_set)
| ~ subset(skc5,unordered_pair(skc6,skc7)) ),
file('SET901+1.p',unknown),
[] ).
cnf(8,axiom,
( ~ equal(u,singleton(v))
| subset(u,unordered_pair(v,w)) ),
file('SET901+1.p',unknown),
[] ).
cnf(9,axiom,
( ~ equal(u,singleton(v))
| subset(u,unordered_pair(w,v)) ),
file('SET901+1.p',unknown),
[] ).
cnf(10,axiom,
( ~ equal(singleton(skc6),skc5)
| ~ subset(skc5,unordered_pair(skc6,skc7)) ),
file('SET901+1.p',unknown),
[] ).
cnf(11,axiom,
( ~ equal(singleton(skc7),skc5)
| ~ subset(skc5,unordered_pair(skc6,skc7)) ),
file('SET901+1.p',unknown),
[] ).
cnf(12,axiom,
( ~ equal(u,unordered_pair(v,w))
| subset(u,unordered_pair(v,w)) ),
file('SET901+1.p',unknown),
[] ).
cnf(13,axiom,
( ~ equal(unordered_pair(skc6,skc7),skc5)
| ~ subset(skc5,unordered_pair(skc6,skc7)) ),
file('SET901+1.p',unknown),
[] ).
cnf(14,axiom,
( subset(skc5,unordered_pair(skc6,skc7))
| equal(skc5,empty_set)
| equal(singleton(skc6),skc5)
| equal(singleton(skc7),skc5)
| equal(unordered_pair(skc6,skc7),skc5) ),
file('SET901+1.p',unknown),
[] ).
cnf(15,axiom,
( ~ subset(u,unordered_pair(v,w))
| equal(u,empty_set)
| equal(u,singleton(v))
| equal(u,singleton(w))
| equal(u,unordered_pair(v,w)) ),
file('SET901+1.p',unknown),
[] ).
cnf(16,plain,
~ equal(skc5,empty_set),
inference(mrr,[status(thm)],[7,6]),
[iquote('0:MRR:7.1,6.1')] ).
cnf(17,plain,
~ equal(singleton(skc7),skc5),
inference(mrr,[status(thm)],[11,9]),
[iquote('0:MRR:11.1,9.1')] ).
cnf(18,plain,
~ equal(singleton(skc6),skc5),
inference(mrr,[status(thm)],[10,8]),
[iquote('0:MRR:10.1,8.1')] ).
cnf(19,plain,
~ equal(unordered_pair(skc6,skc7),skc5),
inference(mrr,[status(thm)],[13,12]),
[iquote('0:MRR:13.1,12.1')] ).
cnf(20,plain,
subset(skc5,unordered_pair(skc6,skc7)),
inference(mrr,[status(thm)],[14,16,18,17,19]),
[iquote('0:MRR:14.1,14.2,14.3,14.4,16.0,18.0,17.0,19.0')] ).
cnf(26,plain,
( equal(singleton(skc7),skc5)
| equal(unordered_pair(skc6,skc7),skc5)
| equal(singleton(skc6),skc5)
| equal(skc5,empty_set) ),
inference(res,[status(thm),theory(equality)],[20,15]),
[iquote('0:Res:20.0,15.0')] ).
cnf(28,plain,
$false,
inference(mrr,[status(thm)],[26,17,19,18,16]),
[iquote('0:MRR:26.0,26.1,26.2,26.3,17.0,19.0,18.0,16.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : SET901+1 : TPTP v8.1.0. Released v3.2.0.
% 0.00/0.12 % Command : run_spass %d %s
% 0.11/0.32 % Computer : n003.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 300
% 0.11/0.32 % WCLimit : 600
% 0.11/0.32 % DateTime : Sun Jul 10 13:51:29 EDT 2022
% 0.11/0.32 % CPUTime :
% 0.17/0.43
% 0.17/0.43 SPASS V 3.9
% 0.17/0.43 SPASS beiseite: Proof found.
% 0.17/0.43 % SZS status Theorem
% 0.17/0.43 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.17/0.43 SPASS derived 7 clauses, backtracked 0 clauses, performed 0 splits and kept 16 clauses.
% 0.17/0.43 SPASS allocated 85090 KBytes.
% 0.17/0.43 SPASS spent 0:00:00.09 on the problem.
% 0.17/0.43 0:00:00.04 for the input.
% 0.17/0.43 0:00:00.03 for the FLOTTER CNF translation.
% 0.17/0.43 0:00:00.00 for inferences.
% 0.17/0.43 0:00:00.00 for the backtracking.
% 0.17/0.43 0:00:00.00 for the reduction.
% 0.17/0.43
% 0.17/0.43
% 0.17/0.43 Here is a proof with depth 1, length 17 :
% 0.17/0.43 % SZS output start Refutation
% See solution above
% 0.17/0.43 Formulae used in the proof : l46_zfmisc_1 t42_zfmisc_1
% 0.17/0.43
%------------------------------------------------------------------------------