TSTP Solution File: SEU187+1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : SEU187+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n028.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 0.19s 0.50s
% Output : Refutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 10
% Syntax : Number of clauses : 27 ( 7 unt; 5 nHn; 27 RR)
% Number of literals : 58 ( 0 equ; 36 neg)
% Maximal clause size : 4 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 6 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 4 con; 0-2 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(2,axiom,
empty(empty_set),
file('SEU187+1.p',unknown),
[] ).
cnf(3,axiom,
relation(empty_set),
file('SEU187+1.p',unknown),
[] ).
cnf(10,axiom,
element(skf16(u),u),
file('SEU187+1.p',unknown),
[] ).
cnf(12,axiom,
( ~ empty(u)
| relation(u) ),
file('SEU187+1.p',unknown),
[] ).
cnf(15,axiom,
( ~ empty(u)
| equal(u,empty_set) ),
file('SEU187+1.p',unknown),
[] ).
cnf(18,axiom,
( ~ empty(u)
| ~ in(v,u) ),
file('SEU187+1.p',unknown),
[] ).
cnf(22,axiom,
( ~ element(u,v)
| empty(v)
| in(u,v) ),
file('SEU187+1.p',unknown),
[] ).
cnf(24,axiom,
( ~ equal(relation_rng(empty_set),empty_set)
| ~ equal(relation_dom(empty_set),empty_set) ),
file('SEU187+1.p',unknown),
[] ).
cnf(33,axiom,
( ~ relation(u)
| ~ in(v,w)
| ~ equal(w,relation_rng(u))
| in(ordered_pair(skf12(u,v),v),u) ),
file('SEU187+1.p',unknown),
[] ).
cnf(35,axiom,
( ~ relation(u)
| equal(v,relation_dom(u))
| in(skf10(u,v),v)
| in(ordered_pair(skf10(u,v),skf11(v,u)),u) ),
file('SEU187+1.p',unknown),
[] ).
cnf(52,plain,
( empty(u)
| in(skf16(u),u) ),
inference(res,[status(thm),theory(equality)],[10,22]),
[iquote('0:Res:10.0,22.0')] ).
cnf(199,plain,
( ~ relation(u)
| ~ in(v,relation_rng(u))
| in(ordered_pair(skf12(u,v),v),u) ),
inference(eqr,[status(thm),theory(equality)],[33]),
[iquote('0:EqR:33.2')] ).
cnf(200,plain,
( ~ relation(u)
| ~ empty(u)
| ~ in(v,relation_rng(u)) ),
inference(res,[status(thm),theory(equality)],[199,18]),
[iquote('0:Res:199.2,18.1')] ).
cnf(205,plain,
( ~ empty(u)
| ~ in(v,relation_rng(u)) ),
inference(ssi,[status(thm)],[200,12]),
[iquote('0:SSi:200.0,12.1')] ).
cnf(209,plain,
( ~ empty(u)
| empty(relation_rng(u)) ),
inference(res,[status(thm),theory(equality)],[52,205]),
[iquote('0:Res:52.1,205.1')] ).
cnf(216,plain,
( ~ empty(u)
| equal(relation_rng(u),empty_set) ),
inference(ems,[status(thm)],[15,209]),
[iquote('0:EmS:15.0,209.1')] ).
cnf(220,plain,
( ~ empty(u)
| ~ in(v,empty_set) ),
inference(rew,[status(thm),theory(equality)],[216,205]),
[iquote('0:Rew:216.1,205.1')] ).
cnf(235,plain,
( ~ empty(empty_set)
| ~ equal(empty_set,empty_set)
| ~ equal(relation_dom(empty_set),empty_set) ),
inference(spl,[status(thm),theory(equality)],[216,24]),
[iquote('0:SpL:216.1,24.0')] ).
cnf(236,plain,
( ~ empty(empty_set)
| ~ equal(relation_dom(empty_set),empty_set) ),
inference(obv,[status(thm),theory(equality)],[235]),
[iquote('0:Obv:235.1')] ).
cnf(237,plain,
~ equal(relation_dom(empty_set),empty_set),
inference(ssi,[status(thm)],[236,3,2]),
[iquote('0:SSi:236.0,3.0,2.0')] ).
cnf(240,plain,
( ~ relation(u)
| ~ empty(u)
| equal(v,relation_dom(u))
| in(skf10(u,v),v) ),
inference(res,[status(thm),theory(equality)],[35,18]),
[iquote('0:Res:35.3,18.1')] ).
cnf(245,plain,
( ~ empty(u)
| equal(v,relation_dom(u))
| in(skf10(u,v),v) ),
inference(ssi,[status(thm)],[240,12]),
[iquote('0:SSi:240.0,12.1')] ).
cnf(248,plain,
~ in(u,empty_set),
inference(ems,[status(thm)],[220,2]),
[iquote('0:EmS:220.0,2.0')] ).
cnf(342,plain,
( ~ empty(u)
| equal(relation_dom(u),empty_set) ),
inference(res,[status(thm),theory(equality)],[245,248]),
[iquote('0:Res:245.2,248.0')] ).
cnf(368,plain,
( ~ empty(empty_set)
| ~ equal(empty_set,empty_set) ),
inference(spl,[status(thm),theory(equality)],[342,237]),
[iquote('0:SpL:342.1,237.0')] ).
cnf(369,plain,
~ empty(empty_set),
inference(obv,[status(thm),theory(equality)],[368]),
[iquote('0:Obv:368.1')] ).
cnf(370,plain,
$false,
inference(ssi,[status(thm)],[369,3,2]),
[iquote('0:SSi:369.0,3.0,2.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : SEU187+1 : TPTP v8.1.0. Released v3.3.0.
% 0.12/0.13 % Command : run_spass %d %s
% 0.13/0.34 % Computer : n028.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Sun Jun 19 21:56:31 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.19/0.50
% 0.19/0.50 SPASS V 3.9
% 0.19/0.50 SPASS beiseite: Proof found.
% 0.19/0.50 % SZS status Theorem
% 0.19/0.50 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.50 SPASS derived 261 clauses, backtracked 0 clauses, performed 0 splits and kept 141 clauses.
% 0.19/0.50 SPASS allocated 98087 KBytes.
% 0.19/0.50 SPASS spent 0:00:00.14 on the problem.
% 0.19/0.50 0:00:00.04 for the input.
% 0.19/0.50 0:00:00.05 for the FLOTTER CNF translation.
% 0.19/0.50 0:00:00.00 for inferences.
% 0.19/0.50 0:00:00.00 for the backtracking.
% 0.19/0.50 0:00:00.03 for the reduction.
% 0.19/0.50
% 0.19/0.50
% 0.19/0.50 Here is a proof with depth 6, length 27 :
% 0.19/0.50 % SZS output start Refutation
% See solution above
% 0.19/0.50 Formulae used in the proof : fc4_relat_1 existence_m1_subset_1 cc1_relat_1 t6_boole t7_boole t2_subset t60_relat_1 d5_relat_1 antisymmetry_r2_hidden d4_relat_1
% 0.19/0.50
%------------------------------------------------------------------------------