TSTP Solution File: SEU164+3 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : SEU164+3 : TPTP v8.1.0. Bugfixed v4.0.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n005.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:36 EDT 2022
% Result : Theorem 0.18s 0.47s
% Output : Refutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 8
% Syntax : Number of clauses : 18 ( 7 unt; 3 nHn; 18 RR)
% Number of literals : 34 ( 0 equ; 17 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 : 8 ( 8 usr; 4 con; 0-2 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(3,axiom,
subset(u,u),
file('SEU164+3.p',unknown),
[] ).
cnf(5,axiom,
~ equal(union(powerset(skc3)),skc3),
file('SEU164+3.p',unknown),
[] ).
cnf(7,axiom,
in(skf12(u,v),skf13(v,u)),
file('SEU164+3.p',unknown),
[] ).
cnf(13,axiom,
( ~ in(u,v)
| ~ subset(v,w)
| in(u,w) ),
file('SEU164+3.p',unknown),
[] ).
cnf(17,axiom,
( ~ in(u,v)
| ~ equal(v,powerset(w))
| subset(u,w) ),
file('SEU164+3.p',unknown),
[] ).
cnf(18,axiom,
( ~ subset(u,v)
| ~ equal(w,powerset(v))
| in(u,w) ),
file('SEU164+3.p',unknown),
[] ).
cnf(23,axiom,
( equal(u,union(v))
| in(skf13(u,v),v)
| in(skf12(v,u),u) ),
file('SEU164+3.p',unknown),
[] ).
cnf(25,axiom,
( ~ in(u,v)
| ~ in(skf12(v,w),u)
| ~ in(skf12(v,w),w) ),
file('SEU164+3.p',unknown),
[] ).
cnf(31,plain,
( in(skf13(skc3,powerset(skc3)),powerset(skc3))
| in(skf12(powerset(skc3),skc3),skc3) ),
inference(res,[status(thm),theory(equality)],[23,5]),
[iquote('0:Res:23.2,5.0')] ).
cnf(45,plain,
( ~ subset(skf13(u,v),w)
| in(skf12(v,u),w) ),
inference(res,[status(thm),theory(equality)],[7,13]),
[iquote('0:Res:7.0,13.0')] ).
cnf(49,plain,
( ~ in(u,powerset(v))
| subset(u,v) ),
inference(eqr,[status(thm),theory(equality)],[17]),
[iquote('0:EqR:17.1')] ).
cnf(61,plain,
( ~ subset(u,v)
| in(u,powerset(v)) ),
inference(eqr,[status(thm),theory(equality)],[18]),
[iquote('0:EqR:18.1')] ).
cnf(317,plain,
( in(skf12(powerset(skc3),skc3),skc3)
| subset(skf13(skc3,powerset(skc3)),skc3) ),
inference(res,[status(thm),theory(equality)],[31,49]),
[iquote('0:Res:31.0,49.0')] ).
cnf(319,plain,
in(skf12(powerset(skc3),skc3),skc3),
inference(mrr,[status(thm)],[317,45]),
[iquote('0:MRR:317.1,45.0')] ).
cnf(325,plain,
( ~ in(skc3,powerset(skc3))
| ~ in(skf12(powerset(skc3),skc3),skc3) ),
inference(res,[status(thm),theory(equality)],[319,25]),
[iquote('0:Res:319.0,25.1')] ).
cnf(326,plain,
~ in(skc3,powerset(skc3)),
inference(mrr,[status(thm)],[325,319]),
[iquote('0:MRR:325.1,319.0')] ).
cnf(327,plain,
~ subset(skc3,skc3),
inference(res,[status(thm),theory(equality)],[61,326]),
[iquote('0:Res:61.1,326.0')] ).
cnf(328,plain,
$false,
inference(mrr,[status(thm)],[327,3]),
[iquote('0:MRR:327.0,3.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : SEU164+3 : TPTP v8.1.0. Bugfixed v4.0.0.
% 0.06/0.12 % Command : run_spass %d %s
% 0.13/0.31 % Computer : n005.cluster.edu
% 0.13/0.31 % Model : x86_64 x86_64
% 0.13/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.31 % Memory : 8042.1875MB
% 0.13/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.31 % CPULimit : 300
% 0.13/0.31 % WCLimit : 600
% 0.13/0.31 % DateTime : Sun Jun 19 03:20:08 EDT 2022
% 0.13/0.32 % CPUTime :
% 0.18/0.47
% 0.18/0.47 SPASS V 3.9
% 0.18/0.47 SPASS beiseite: Proof found.
% 0.18/0.47 % SZS status Theorem
% 0.18/0.47 Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.18/0.47 SPASS derived 290 clauses, backtracked 0 clauses, performed 0 splits and kept 260 clauses.
% 0.18/0.47 SPASS allocated 85490 KBytes.
% 0.18/0.47 SPASS spent 0:00:00.14 on the problem.
% 0.18/0.47 0:00:00.04 for the input.
% 0.18/0.47 0:00:00.04 for the FLOTTER CNF translation.
% 0.18/0.47 0:00:00.01 for inferences.
% 0.18/0.47 0:00:00.00 for the backtracking.
% 0.18/0.47 0:00:00.04 for the reduction.
% 0.18/0.47
% 0.18/0.47
% 0.18/0.47 Here is a proof with depth 4, length 18 :
% 0.18/0.47 % SZS output start Refutation
% See solution above
% 0.18/0.47 Formulae used in the proof : reflexivity_r1_tarski t99_zfmisc_1 d4_tarski l2_zfmisc_1 d3_tarski antisymmetry_r2_hidden d1_zfmisc_1
% 0.18/0.47
%------------------------------------------------------------------------------