TSTP Solution File: SEU280+1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : SEU280+1 : TPTP v8.1.0. Released v3.3.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:35:48 EDT 2022
% Result : Theorem 0.20s 0.44s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 7
% Syntax : Number of clauses : 19 ( 5 unt; 4 nHn; 19 RR)
% Number of literals : 40 ( 0 equ; 22 neg)
% Maximal clause size : 4 ( 2 avg)
% Maximal term depth : 3 ( 2 avg)
% Number of predicates : 5 ( 4 usr; 2 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 4 con; 0-1 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(7,axiom,
( ~ equal(skc9,skc9)
| skC0 ),
file('SEU280+1.p',unknown),
[] ).
cnf(8,axiom,
( ordinal(skf2(u))
| in(skf2(u),u) ),
file('SEU280+1.p',unknown),
[] ).
cnf(9,axiom,
( in(skf2(u),u)
| in(skf2(u),skc3) ),
file('SEU280+1.p',unknown),
[] ).
cnf(12,axiom,
( ~ in(u,skf5(v))
| ~ skC0
| ordinal(u) ),
file('SEU280+1.p',unknown),
[] ).
cnf(13,axiom,
( ~ in(u,skf5(v))
| ~ skC0
| in(u,v) ),
file('SEU280+1.p',unknown),
[] ).
cnf(14,axiom,
( ~ ordinal(u)
| ~ in(u,v)
| in(u,skf5(v)) ),
file('SEU280+1.p',unknown),
[] ).
cnf(15,axiom,
( ~ ordinal(skf2(u))
| ~ in(skf2(u),u)
| ~ in(skf2(u),skc3) ),
file('SEU280+1.p',unknown),
[] ).
cnf(16,plain,
skC0,
inference(obv,[status(thm),theory(equality)],[7]),
[iquote('0:Obv:7.0')] ).
cnf(17,plain,
( ~ in(u,skf5(v))
| ordinal(u) ),
inference(mrr,[status(thm)],[12,16]),
[iquote('0:MRR:12.1,16.0')] ).
cnf(18,plain,
( ~ in(u,skf5(v))
| in(u,v) ),
inference(mrr,[status(thm)],[13,16]),
[iquote('0:MRR:13.1,16.0')] ).
cnf(28,plain,
( ordinal(skf2(skf5(u)))
| ordinal(skf2(skf5(u))) ),
inference(res,[status(thm),theory(equality)],[8,17]),
[iquote('0:Res:8.1,17.0')] ).
cnf(29,plain,
ordinal(skf2(skf5(u))),
inference(obv,[status(thm),theory(equality)],[28]),
[iquote('0:Obv:28.0')] ).
cnf(32,plain,
( in(skf2(skf5(u)),skc3)
| in(skf2(skf5(u)),u) ),
inference(res,[status(thm),theory(equality)],[9,18]),
[iquote('0:Res:9.0,18.0')] ).
cnf(44,plain,
in(skf2(skf5(skc3)),skc3),
inference(fac,[status(thm)],[32]),
[iquote('0:Fac:32.0,32.1')] ).
cnf(54,plain,
( ~ ordinal(skf2(skf5(u)))
| ~ in(skf2(skf5(u)),u)
| ~ ordinal(skf2(skf5(u)))
| ~ in(skf2(skf5(u)),skc3) ),
inference(res,[status(thm),theory(equality)],[14,15]),
[iquote('0:Res:14.2,15.1')] ).
cnf(56,plain,
( ~ in(skf2(skf5(u)),u)
| ~ ordinal(skf2(skf5(u)))
| ~ in(skf2(skf5(u)),skc3) ),
inference(obv,[status(thm),theory(equality)],[54]),
[iquote('0:Obv:54.0')] ).
cnf(57,plain,
( ~ in(skf2(skf5(u)),u)
| ~ in(skf2(skf5(u)),skc3) ),
inference(mrr,[status(thm)],[56,29]),
[iquote('0:MRR:56.1,29.0')] ).
cnf(65,plain,
~ in(skf2(skf5(skc3)),skc3),
inference(res,[status(thm),theory(equality)],[44,57]),
[iquote('0:Res:44.0,57.0')] ).
cnf(69,plain,
$false,
inference(mrr,[status(thm)],[65,44]),
[iquote('0:MRR:65.0,44.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : SEU280+1 : TPTP v8.1.0. Released v3.3.0.
% 0.06/0.13 % Command : run_spass %d %s
% 0.12/0.34 % Computer : n005.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 01:26:08 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.20/0.44
% 0.20/0.44 SPASS V 3.9
% 0.20/0.44 SPASS beiseite: Proof found.
% 0.20/0.44 % SZS status Theorem
% 0.20/0.44 Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.20/0.44 SPASS derived 36 clauses, backtracked 0 clauses, performed 0 splits and kept 37 clauses.
% 0.20/0.44 SPASS allocated 97714 KBytes.
% 0.20/0.44 SPASS spent 0:00:00.09 on the problem.
% 0.20/0.44 0:00:00.04 for the input.
% 0.20/0.44 0:00:00.03 for the FLOTTER CNF translation.
% 0.20/0.44 0:00:00.00 for inferences.
% 0.20/0.44 0:00:00.00 for the backtracking.
% 0.20/0.44 0:00:00.00 for the reduction.
% 0.20/0.44
% 0.20/0.44
% 0.20/0.44 Here is a proof with depth 3, length 19 :
% 0.20/0.44 % SZS output start Refutation
% See solution above
% 0.20/0.45 Formulae used in the proof : s1_tarski__e6_22__wellord2__1 rc1_ordinal1 cc1_ordinal1 cc2_ordinal1 s1_xboole_0__e6_22__wellord2
% 0.20/0.45
%------------------------------------------------------------------------------