TSTP Solution File: SEU186+2 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : SEU186+2 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n012.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:49 EDT 2022
% Result : Theorem 9.32s 9.53s
% Output : Refutation 9.32s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 10
% Syntax : Number of clauses : 20 ( 9 unt; 3 nHn; 20 RR)
% Number of literals : 33 ( 0 equ; 17 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 7 ( 6 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 5 con; 0-2 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
relation(skc5),
file('SEU186+2.p',unknown),
[] ).
cnf(14,axiom,
~ equal(empty_set,skc5),
file('SEU186+2.p',unknown),
[] ).
cnf(41,axiom,
~ in(ordered_pair(u,v),skc5),
file('SEU186+2.p',unknown),
[] ).
cnf(47,axiom,
( ~ empty(u)
| equal(u,empty_set) ),
file('SEU186+2.p',unknown),
[] ).
cnf(53,axiom,
( equal(u,empty_set)
| in(skf53(u),u) ),
file('SEU186+2.p',unknown),
[] ).
cnf(61,axiom,
( ~ in(u,v)
| element(u,v) ),
file('SEU186+2.p',unknown),
[] ).
cnf(81,axiom,
( disjoint(u,v)
| in(skf89(v,w),v) ),
file('SEU186+2.p',unknown),
[] ).
cnf(93,axiom,
( ~ in(u,v)
| ~ disjoint(singleton(u),v) ),
file('SEU186+2.p',unknown),
[] ).
cnf(100,axiom,
( ~ element(u,v)
| empty(v)
| in(u,v) ),
file('SEU186+2.p',unknown),
[] ).
cnf(192,axiom,
( ~ relation(u)
| ~ in(v,u)
| equal(ordered_pair(skf44(v),skf43(v)),v) ),
file('SEU186+2.p',unknown),
[] ).
cnf(306,plain,
( ~ in(u,skc5)
| equal(ordered_pair(skf44(u),skf43(u)),u) ),
inference(res,[status(thm),theory(equality)],[1,192]),
[iquote('0:Res:1.0,192.0')] ).
cnf(364,plain,
in(skf53(skc5),skc5),
inference(res,[status(thm),theory(equality)],[53,14]),
[iquote('0:Res:53.1,14.0')] ).
cnf(365,plain,
~ empty(skc5),
inference(res,[status(thm),theory(equality)],[47,14]),
[iquote('0:Res:47.1,14.0')] ).
cnf(384,plain,
( ~ element(ordered_pair(u,v),skc5)
| empty(skc5) ),
inference(res,[status(thm),theory(equality)],[100,41]),
[iquote('0:Res:100.1,41.0')] ).
cnf(433,plain,
~ element(ordered_pair(u,v),skc5),
inference(mrr,[status(thm)],[384,365]),
[iquote('0:MRR:384.1,365.0')] ).
cnf(871,plain,
( ~ in(u,v)
| in(skf89(v,w),v) ),
inference(res,[status(thm),theory(equality)],[81,93]),
[iquote('0:Res:81.0,93.1')] ).
cnf(1944,plain,
in(skf89(skc5,u),skc5),
inference(res,[status(thm),theory(equality)],[364,871]),
[iquote('0:Res:364.0,871.0')] ).
cnf(17815,plain,
( ~ in(u,skc5)
| ~ element(u,skc5) ),
inference(spl,[status(thm),theory(equality)],[306,433]),
[iquote('0:SpL:306.1,433.0')] ).
cnf(17886,plain,
~ in(u,skc5),
inference(mrr,[status(thm)],[17815,61]),
[iquote('0:MRR:17815.1,61.1')] ).
cnf(17887,plain,
$false,
inference(unc,[status(thm)],[17886,1944]),
[iquote('0:UnC:17886.0,1944.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.11 % Problem : SEU186+2 : TPTP v8.1.0. Released v3.3.0.
% 0.07/0.12 % Command : run_spass %d %s
% 0.13/0.33 % Computer : n012.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 600
% 0.13/0.33 % DateTime : Mon Jun 20 03:24:07 EDT 2022
% 0.13/0.33 % CPUTime :
% 9.32/9.53
% 9.32/9.53 SPASS V 3.9
% 9.32/9.53 SPASS beiseite: Proof found.
% 9.32/9.53 % SZS status Theorem
% 9.32/9.53 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 9.32/9.53 SPASS derived 15488 clauses, backtracked 1 clauses, performed 1 splits and kept 7063 clauses.
% 9.32/9.53 SPASS allocated 112178 KBytes.
% 9.32/9.53 SPASS spent 0:00:09.03 on the problem.
% 9.32/9.53 0:00:00.04 for the input.
% 9.32/9.53 0:00:00.85 for the FLOTTER CNF translation.
% 9.32/9.53 0:00:00.21 for inferences.
% 9.32/9.53 0:00:00.14 for the backtracking.
% 9.32/9.53 0:00:07.61 for the reduction.
% 9.32/9.53
% 9.32/9.53
% 9.32/9.53 Here is a proof with depth 2, length 20 :
% 9.32/9.53 % SZS output start Refutation
% See solution above
% 9.32/9.53 Formulae used in the proof : t56_relat_1 t6_boole d1_xboole_0 t1_subset t3_xboole_0 l25_zfmisc_1 t2_subset d1_relat_1
% 9.32/9.53
%------------------------------------------------------------------------------