TSTP Solution File: SEU160+1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : SEU160+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n021.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 14:34:31 EDT 2022
% Result : Theorem 0.20s 0.44s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 6
% Syntax : Number of clauses : 11 ( 4 unt; 3 nHn; 11 RR)
% Number of literals : 20 ( 0 equ; 9 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 5 con; 0-1 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(5,axiom,
( ~ equal(u,empty_set)
| subset(u,singleton(v)) ),
file('SEU160+1.p',unknown),
[] ).
cnf(6,axiom,
( ~ equal(skc4,empty_set)
| ~ subset(skc4,singleton(skc5)) ),
file('SEU160+1.p',unknown),
[] ).
cnf(7,axiom,
( ~ equal(u,singleton(v))
| subset(u,singleton(v)) ),
file('SEU160+1.p',unknown),
[] ).
cnf(8,axiom,
( ~ equal(singleton(skc5),skc4)
| ~ subset(skc4,singleton(skc5)) ),
file('SEU160+1.p',unknown),
[] ).
cnf(9,axiom,
( subset(skc4,singleton(skc5))
| equal(skc4,empty_set)
| equal(singleton(skc5),skc4) ),
file('SEU160+1.p',unknown),
[] ).
cnf(10,axiom,
( ~ subset(u,singleton(v))
| equal(u,empty_set)
| equal(u,singleton(v)) ),
file('SEU160+1.p',unknown),
[] ).
cnf(11,plain,
~ equal(skc4,empty_set),
inference(mrr,[status(thm)],[6,5]),
[iquote('0:MRR:6.1,5.1')] ).
cnf(12,plain,
~ equal(singleton(skc5),skc4),
inference(mrr,[status(thm)],[8,7]),
[iquote('0:MRR:8.1,7.1')] ).
cnf(13,plain,
subset(skc4,singleton(skc5)),
inference(mrr,[status(thm)],[9,11,12]),
[iquote('0:MRR:9.1,9.2,11.0,12.0')] ).
cnf(15,plain,
( equal(singleton(skc5),skc4)
| equal(skc4,empty_set) ),
inference(res,[status(thm),theory(equality)],[13,10]),
[iquote('0:Res:13.0,10.0')] ).
cnf(17,plain,
$false,
inference(mrr,[status(thm)],[15,12,11]),
[iquote('0:MRR:15.0,15.1,12.0,11.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SEU160+1 : TPTP v8.1.0. Released v3.3.0.
% 0.03/0.13 % Command : run_spass %d %s
% 0.12/0.34 % Computer : n021.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 : Mon Jun 20 03:23:03 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 3 clauses, backtracked 0 clauses, performed 0 splits and kept 11 clauses.
% 0.20/0.44 SPASS allocated 85068 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 1, length 11 :
% 0.20/0.44 % SZS output start Refutation
% See solution above
% 0.20/0.44 Formulae used in the proof : l4_zfmisc_1 t39_zfmisc_1
% 0.20/0.44
%------------------------------------------------------------------------------