TSTP Solution File: SEU147+1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : SEU147+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n029.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:20 EDT 2022
% Result : Theorem 0.19s 0.44s
% Output : Refutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 7
% Syntax : Number of clauses : 17 ( 6 unt; 3 nHn; 17 RR)
% Number of literals : 33 ( 0 equ; 16 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 : 7 ( 7 usr; 4 con; 0-2 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(4,axiom,
subset(u,u),
file('SEU147+1.p',unknown),
[] ).
cnf(5,axiom,
~ equal(powerset(empty_set),singleton(empty_set)),
file('SEU147+1.p',unknown),
[] ).
cnf(6,axiom,
( ~ subset(u,empty_set)
| equal(u,empty_set) ),
file('SEU147+1.p',unknown),
[] ).
cnf(8,axiom,
( subset(skf4(u,v),u)
| in(skf4(u,v),v) ),
file('SEU147+1.p',unknown),
[] ).
cnf(10,axiom,
( ~ in(u,v)
| ~ equal(v,singleton(w))
| equal(u,w) ),
file('SEU147+1.p',unknown),
[] ).
cnf(11,axiom,
( ~ equal(u,v)
| ~ equal(w,singleton(v))
| in(u,w) ),
file('SEU147+1.p',unknown),
[] ).
cnf(17,axiom,
( ~ subset(skf4(u,v),u)
| ~ in(skf4(u,v),v)
| equal(v,powerset(u)) ),
file('SEU147+1.p',unknown),
[] ).
cnf(25,plain,
( in(skf4(empty_set,u),u)
| equal(skf4(empty_set,u),empty_set) ),
inference(res,[status(thm),theory(equality)],[8,6]),
[iquote('0:Res:8.0,6.0')] ).
cnf(28,plain,
( ~ in(u,singleton(v))
| equal(u,v) ),
inference(eqr,[status(thm),theory(equality)],[10]),
[iquote('0:EqR:10.1')] ).
cnf(31,plain,
( equal(skf4(empty_set,singleton(u)),empty_set)
| equal(skf4(empty_set,singleton(u)),u) ),
inference(res,[status(thm),theory(equality)],[25,28]),
[iquote('0:Res:25.0,28.0')] ).
cnf(36,plain,
equal(skf4(empty_set,singleton(empty_set)),empty_set),
inference(fac,[status(thm)],[31]),
[iquote('0:Fac:31.0,31.1')] ).
cnf(60,plain,
( ~ equal(u,v)
| in(u,singleton(v)) ),
inference(eqr,[status(thm),theory(equality)],[11]),
[iquote('0:EqR:11.1')] ).
cnf(134,plain,
( ~ subset(empty_set,empty_set)
| ~ in(skf4(empty_set,singleton(empty_set)),singleton(empty_set))
| equal(powerset(empty_set),singleton(empty_set)) ),
inference(spl,[status(thm),theory(equality)],[36,17]),
[iquote('0:SpL:36.0,17.0')] ).
cnf(138,plain,
( ~ subset(empty_set,empty_set)
| ~ in(empty_set,singleton(empty_set))
| equal(powerset(empty_set),singleton(empty_set)) ),
inference(rew,[status(thm),theory(equality)],[36,134]),
[iquote('0:Rew:36.0,134.1')] ).
cnf(139,plain,
~ in(empty_set,singleton(empty_set)),
inference(mrr,[status(thm)],[138,4,5]),
[iquote('0:MRR:138.0,138.2,4.0,5.0')] ).
cnf(145,plain,
~ equal(empty_set,empty_set),
inference(res,[status(thm),theory(equality)],[60,139]),
[iquote('0:Res:60.1,139.0')] ).
cnf(147,plain,
$false,
inference(obv,[status(thm),theory(equality)],[145]),
[iquote('0:Obv:145.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.11 % Problem : SEU147+1 : TPTP v8.1.0. Released v3.3.0.
% 0.07/0.12 % Command : run_spass %d %s
% 0.12/0.33 % Computer : n029.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Mon Jun 20 02:23:45 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.19/0.44
% 0.19/0.44 SPASS V 3.9
% 0.19/0.44 SPASS beiseite: Proof found.
% 0.19/0.44 % SZS status Theorem
% 0.19/0.44 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.44 SPASS derived 103 clauses, backtracked 0 clauses, performed 0 splits and kept 65 clauses.
% 0.19/0.44 SPASS allocated 85250 KBytes.
% 0.19/0.44 SPASS spent 0:00:00.10 on the problem.
% 0.19/0.44 0:00:00.03 for the input.
% 0.19/0.44 0:00:00.03 for the FLOTTER CNF translation.
% 0.19/0.44 0:00:00.00 for inferences.
% 0.19/0.44 0:00:00.00 for the backtracking.
% 0.19/0.44 0:00:00.01 for the reduction.
% 0.19/0.44
% 0.19/0.44
% 0.19/0.44 Here is a proof with depth 5, length 17 :
% 0.19/0.44 % SZS output start Refutation
% See solution above
% 0.19/0.44 Formulae used in the proof : reflexivity_r1_tarski t1_zfmisc_1 t3_xboole_1 d1_zfmisc_1 d1_tarski antisymmetry_r2_hidden
% 0.19/0.44
%------------------------------------------------------------------------------