TSTP Solution File: SEU164+1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : SEU164+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n020.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:35 EDT 2022
% Result : Theorem 0.19s 0.48s
% Output : Refutation 0.19s
% 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(1,axiom,
subset(u,u),
file('SEU164+1.p',unknown),
[] ).
cnf(3,axiom,
~ equal(union(powerset(skc1)),skc1),
file('SEU164+1.p',unknown),
[] ).
cnf(5,axiom,
in(skf12(u,v),skf13(v,u)),
file('SEU164+1.p',unknown),
[] ).
cnf(11,axiom,
( ~ in(u,v)
| ~ subset(v,w)
| in(u,w) ),
file('SEU164+1.p',unknown),
[] ).
cnf(15,axiom,
( ~ in(u,v)
| ~ equal(v,powerset(w))
| subset(u,w) ),
file('SEU164+1.p',unknown),
[] ).
cnf(16,axiom,
( ~ subset(u,v)
| ~ equal(w,powerset(v))
| in(u,w) ),
file('SEU164+1.p',unknown),
[] ).
cnf(21,axiom,
( equal(u,union(v))
| in(skf13(u,v),v)
| in(skf12(v,u),u) ),
file('SEU164+1.p',unknown),
[] ).
cnf(23,axiom,
( ~ in(u,v)
| ~ in(skf12(v,w),u)
| ~ in(skf12(v,w),w) ),
file('SEU164+1.p',unknown),
[] ).
cnf(29,plain,
( in(skf13(skc1,powerset(skc1)),powerset(skc1))
| in(skf12(powerset(skc1),skc1),skc1) ),
inference(res,[status(thm),theory(equality)],[21,3]),
[iquote('0:Res:21.2,3.0')] ).
cnf(43,plain,
( ~ subset(skf13(u,v),w)
| in(skf12(v,u),w) ),
inference(res,[status(thm),theory(equality)],[5,11]),
[iquote('0:Res:5.0,11.0')] ).
cnf(57,plain,
( ~ in(u,powerset(v))
| subset(u,v) ),
inference(eqr,[status(thm),theory(equality)],[15]),
[iquote('0:EqR:15.1')] ).
cnf(71,plain,
( ~ subset(u,v)
| in(u,powerset(v)) ),
inference(eqr,[status(thm),theory(equality)],[16]),
[iquote('0:EqR:16.1')] ).
cnf(270,plain,
( in(skf12(powerset(skc1),skc1),skc1)
| subset(skf13(skc1,powerset(skc1)),skc1) ),
inference(res,[status(thm),theory(equality)],[29,57]),
[iquote('0:Res:29.0,57.0')] ).
cnf(272,plain,
in(skf12(powerset(skc1),skc1),skc1),
inference(mrr,[status(thm)],[270,43]),
[iquote('0:MRR:270.1,43.0')] ).
cnf(277,plain,
( ~ in(skc1,powerset(skc1))
| ~ in(skf12(powerset(skc1),skc1),skc1) ),
inference(res,[status(thm),theory(equality)],[272,23]),
[iquote('0:Res:272.0,23.1')] ).
cnf(278,plain,
~ in(skc1,powerset(skc1)),
inference(mrr,[status(thm)],[277,272]),
[iquote('0:MRR:277.1,272.0')] ).
cnf(279,plain,
~ subset(skc1,skc1),
inference(res,[status(thm),theory(equality)],[71,278]),
[iquote('0:Res:71.1,278.0')] ).
cnf(280,plain,
$false,
inference(mrr,[status(thm)],[279,1]),
[iquote('0:MRR:279.0,1.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : SEU164+1 : TPTP v8.1.0. Released v3.3.0.
% 0.03/0.12 % Command : run_spass %d %s
% 0.12/0.33 % Computer : n020.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 06:17:03 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.19/0.48
% 0.19/0.48 SPASS V 3.9
% 0.19/0.48 SPASS beiseite: Proof found.
% 0.19/0.48 % SZS status Theorem
% 0.19/0.48 Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.48 SPASS derived 244 clauses, backtracked 0 clauses, performed 0 splits and kept 215 clauses.
% 0.19/0.48 SPASS allocated 85453 KBytes.
% 0.19/0.48 SPASS spent 0:00:00.13 on the problem.
% 0.19/0.48 0:00:00.03 for the input.
% 0.19/0.48 0:00:00.04 for the FLOTTER CNF translation.
% 0.19/0.48 0:00:00.01 for inferences.
% 0.19/0.48 0:00:00.00 for the backtracking.
% 0.19/0.48 0:00:00.03 for the reduction.
% 0.19/0.48
% 0.19/0.48
% 0.19/0.48 Here is a proof with depth 4, length 18 :
% 0.19/0.48 % SZS output start Refutation
% See solution above
% 0.19/0.48 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.19/0.48
%------------------------------------------------------------------------------