TSTP Solution File: SEU121+1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : SEU121+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n016.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:05 EDT 2022
% Result : Theorem 0.18s 0.43s
% Output : Refutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 6
% Syntax : Number of clauses : 13 ( 8 unt; 1 nHn; 13 RR)
% Number of literals : 19 ( 0 equ; 8 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 6 con; 0-2 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(3,axiom,
subset(skc7,skc5),
file('SEU121+1.p',unknown),
[] ).
cnf(4,axiom,
subset(skc5,skc6),
file('SEU121+1.p',unknown),
[] ).
cnf(7,axiom,
~ subset(skc7,skc6),
file('SEU121+1.p',unknown),
[] ).
cnf(11,axiom,
( subset(u,v)
| in(skf1(v,u),u) ),
file('SEU121+1.p',unknown),
[] ).
cnf(12,axiom,
( ~ in(skf1(u,v),u)
| subset(w,u) ),
file('SEU121+1.p',unknown),
[] ).
cnf(14,axiom,
( ~ in(u,v)
| ~ subset(v,w)
| in(u,w) ),
file('SEU121+1.p',unknown),
[] ).
cnf(15,plain,
( ~ in(u,skc5)
| in(u,skc6) ),
inference(res,[status(thm),theory(equality)],[4,14]),
[iquote('0:Res:4.0,14.0')] ).
cnf(16,plain,
( ~ in(u,skc7)
| in(u,skc5) ),
inference(res,[status(thm),theory(equality)],[3,14]),
[iquote('0:Res:3.0,14.0')] ).
cnf(17,plain,
in(skf1(skc6,skc7),skc7),
inference(res,[status(thm),theory(equality)],[11,7]),
[iquote('0:Res:11.1,7.0')] ).
cnf(18,plain,
~ in(skf1(skc6,u),skc6),
inference(res,[status(thm),theory(equality)],[12,7]),
[iquote('0:Res:12.1,7.0')] ).
cnf(25,plain,
in(skf1(skc6,skc7),skc5),
inference(res,[status(thm),theory(equality)],[17,16]),
[iquote('0:Res:17.0,16.0')] ).
cnf(26,plain,
~ in(skf1(skc6,u),skc5),
inference(res,[status(thm),theory(equality)],[15,18]),
[iquote('0:Res:15.1,18.0')] ).
cnf(27,plain,
$false,
inference(unc,[status(thm)],[26,25]),
[iquote('0:UnC:26.0,25.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : SEU121+1 : TPTP v8.1.0. Released v3.3.0.
% 0.03/0.12 % Command : run_spass %d %s
% 0.12/0.33 % Computer : n016.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 07:17:10 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.18/0.43
% 0.18/0.43 SPASS V 3.9
% 0.18/0.43 SPASS beiseite: Proof found.
% 0.18/0.43 % SZS status Theorem
% 0.18/0.43 Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.18/0.43 SPASS derived 10 clauses, backtracked 0 clauses, performed 0 splits and kept 21 clauses.
% 0.18/0.43 SPASS allocated 103943 KBytes.
% 0.18/0.43 SPASS spent 0:00:00.08 on the problem.
% 0.18/0.43 0:00:00.03 for the input.
% 0.18/0.43 0:00:00.03 for the FLOTTER CNF translation.
% 0.18/0.43 0:00:00.00 for inferences.
% 0.18/0.43 0:00:00.00 for the backtracking.
% 0.18/0.43 0:00:00.00 for the reduction.
% 0.18/0.43
% 0.18/0.43
% 0.18/0.43 Here is a proof with depth 2, length 13 :
% 0.18/0.43 % SZS output start Refutation
% See solution above
% 0.18/0.43 Formulae used in the proof : t1_xboole_1 d3_tarski
% 0.18/0.43
%------------------------------------------------------------------------------