TSTP Solution File: SEU193+1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : SEU193+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:52 EDT 2022
% Result : Theorem 0.76s 0.94s
% Output : Refutation 0.76s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 6
% Syntax : Number of clauses : 17 ( 6 unt; 4 nHn; 17 RR)
% Number of literals : 41 ( 0 equ; 23 neg)
% Maximal clause size : 5 ( 2 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 5 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 7 con; 0-2 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
relation(skc6),
file('SEU193+1.p',unknown),
[] ).
cnf(21,axiom,
~ subset(relation_dom_restriction(skc6,skc7),skc6),
file('SEU193+1.p',unknown),
[] ).
cnf(25,axiom,
( ~ relation(u)
| relation(relation_dom_restriction(u,v)) ),
file('SEU193+1.p',unknown),
[] ).
cnf(36,axiom,
( ~ relation(u)
| ~ relation(v)
| subset(v,u)
| in(ordered_pair(skf10(u,v),skf9(u,v)),v) ),
file('SEU193+1.p',unknown),
[] ).
cnf(37,axiom,
( ~ relation(u)
| ~ relation(v)
| ~ in(ordered_pair(skf10(u,w),skf9(u,w)),u)
| subset(v,u) ),
file('SEU193+1.p',unknown),
[] ).
cnf(40,axiom,
( ~ relation(u)
| ~ relation(v)
| ~ equal(u,relation_dom_restriction(v,w))
| ~ in(ordered_pair(x,y),u)
| in(ordered_pair(x,y),v) ),
file('SEU193+1.p',unknown),
[] ).
cnf(49,plain,
( ~ relation(u)
| ~ equal(u,relation_dom_restriction(skc6,v))
| ~ in(ordered_pair(w,x),u)
| in(ordered_pair(w,x),skc6) ),
inference(res,[status(thm),theory(equality)],[1,40]),
[iquote('0:Res:1.0,40.0')] ).
cnf(54,plain,
relation(relation_dom_restriction(skc6,u)),
inference(res,[status(thm),theory(equality)],[1,25]),
[iquote('0:Res:1.0,25.0')] ).
cnf(62,plain,
( ~ relation(u)
| subset(u,skc6)
| in(ordered_pair(skf10(skc6,u),skf9(skc6,u)),u) ),
inference(res,[status(thm),theory(equality)],[1,36]),
[iquote('0:Res:1.0,36.1')] ).
cnf(63,plain,
( ~ relation(relation_dom_restriction(skc6,skc7))
| ~ relation(skc6)
| ~ in(ordered_pair(skf10(skc6,u),skf9(skc6,u)),skc6) ),
inference(res,[status(thm),theory(equality)],[37,21]),
[iquote('0:Res:37.3,21.0')] ).
cnf(66,plain,
~ in(ordered_pair(skf10(skc6,u),skf9(skc6,u)),skc6),
inference(mrr,[status(thm)],[63,54,1]),
[iquote('0:MRR:63.0,63.1,54.0,1.0')] ).
cnf(1309,plain,
( ~ relation(relation_dom_restriction(skc6,u))
| ~ in(ordered_pair(v,w),relation_dom_restriction(skc6,u))
| in(ordered_pair(v,w),skc6) ),
inference(eqr,[status(thm),theory(equality)],[49]),
[iquote('0:EqR:49.1')] ).
cnf(1313,plain,
( ~ in(ordered_pair(u,v),relation_dom_restriction(skc6,w))
| in(ordered_pair(u,v),skc6) ),
inference(ssi,[status(thm)],[1309,54]),
[iquote('0:SSi:1309.0,54.0')] ).
cnf(2190,plain,
( ~ relation(relation_dom_restriction(skc6,u))
| subset(relation_dom_restriction(skc6,u),skc6)
| in(ordered_pair(skf10(skc6,relation_dom_restriction(skc6,u)),skf9(skc6,relation_dom_restriction(skc6,u))),skc6) ),
inference(res,[status(thm),theory(equality)],[62,1313]),
[iquote('0:Res:62.2,1313.0')] ).
cnf(2193,plain,
( subset(relation_dom_restriction(skc6,u),skc6)
| in(ordered_pair(skf10(skc6,relation_dom_restriction(skc6,u)),skf9(skc6,relation_dom_restriction(skc6,u))),skc6) ),
inference(ssi,[status(thm)],[2190,54]),
[iquote('0:SSi:2190.0,54.0')] ).
cnf(2194,plain,
subset(relation_dom_restriction(skc6,u),skc6),
inference(mrr,[status(thm)],[2193,66]),
[iquote('0:MRR:2193.1,66.0')] ).
cnf(2195,plain,
$false,
inference(unc,[status(thm)],[2194,21]),
[iquote('0:UnC:2194.0,21.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : SEU193+1 : TPTP v8.1.0. Released v3.3.0.
% 0.04/0.13 % Command : run_spass %d %s
% 0.12/0.34 % Computer : n020.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Mon Jun 20 04:47:18 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.76/0.94
% 0.76/0.94 SPASS V 3.9
% 0.76/0.94 SPASS beiseite: Proof found.
% 0.76/0.94 % SZS status Theorem
% 0.76/0.94 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.76/0.94 SPASS derived 1780 clauses, backtracked 0 clauses, performed 1 splits and kept 1048 clauses.
% 0.76/0.94 SPASS allocated 99968 KBytes.
% 0.76/0.94 SPASS spent 0:00:00.58 on the problem.
% 0.76/0.94 0:00:00.04 for the input.
% 0.76/0.94 0:00:00.05 for the FLOTTER CNF translation.
% 0.76/0.94 0:00:00.03 for inferences.
% 0.76/0.94 0:00:00.00 for the backtracking.
% 0.76/0.94 0:00:00.43 for the reduction.
% 0.76/0.94
% 0.76/0.94
% 0.76/0.94 Here is a proof with depth 3, length 17 :
% 0.76/0.94 % SZS output start Refutation
% See solution above
% 0.76/0.94 Formulae used in the proof : t88_relat_1 dt_k7_relat_1 d3_relat_1 d11_relat_1 antisymmetry_r2_hidden
% 0.76/0.94
%------------------------------------------------------------------------------