TSTP Solution File: LAT382+3 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : LAT382+3 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n029.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 : Sun Jul 17 06:51:47 EDT 2022
% Result : Theorem 0.19s 0.48s
% Output : Refutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 10
% Syntax : Number of clauses : 21 ( 12 unt; 0 nHn; 21 RR)
% Number of literals : 37 ( 0 equ; 21 neg)
% Maximal clause size : 5 ( 1 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 7 ( 6 usr; 1 prp; 0-3 aty)
% Number of functors : 6 ( 6 usr; 6 con; 0-0 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
aSet0(xT),
file('LAT382+3.p',unknown),
[] ).
cnf(4,axiom,
aElementOf0(xu,xT),
file('LAT382+3.p',unknown),
[] ).
cnf(5,axiom,
aElementOf0(xv,xT),
file('LAT382+3.p',unknown),
[] ).
cnf(6,axiom,
~ equal(xv,xu),
file('LAT382+3.p',unknown),
[] ).
cnf(7,axiom,
aLowerBoundOfIn0(xu,xS,xT),
file('LAT382+3.p',unknown),
[] ).
cnf(9,axiom,
aLowerBoundOfIn0(xv,xS,xT),
file('LAT382+3.p',unknown),
[] ).
cnf(15,axiom,
( ~ aLowerBoundOfIn0(u,xS,xT)
| sdtlseqdt0(u,xu) ),
file('LAT382+3.p',unknown),
[] ).
cnf(16,axiom,
( ~ aLowerBoundOfIn0(u,xS,xT)
| sdtlseqdt0(u,xv) ),
file('LAT382+3.p',unknown),
[] ).
cnf(17,axiom,
( ~ aSet0(u)
| ~ aElementOf0(v,u)
| aElement0(v) ),
file('LAT382+3.p',unknown),
[] ).
cnf(34,axiom,
( ~ aElement0(u)
| ~ aElement0(v)
| ~ sdtlseqdt0(v,u)
| ~ sdtlseqdt0(u,v)
| equal(v,u) ),
file('LAT382+3.p',unknown),
[] ).
cnf(53,plain,
( ~ aElement0(xu)
| ~ aElement0(xv)
| ~ sdtlseqdt0(xv,xu)
| ~ sdtlseqdt0(xu,xv) ),
inference(res,[status(thm),theory(equality)],[34,6]),
[iquote('0:Res:34.4,6.0')] ).
cnf(60,plain,
sdtlseqdt0(xu,xv),
inference(res,[status(thm),theory(equality)],[7,16]),
[iquote('0:Res:7.0,16.0')] ).
cnf(61,plain,
( ~ aElement0(xu)
| ~ aElement0(xv)
| ~ sdtlseqdt0(xv,xu) ),
inference(mrr,[status(thm)],[53,60]),
[iquote('0:MRR:53.3,60.0')] ).
cnf(62,plain,
sdtlseqdt0(xv,xu),
inference(res,[status(thm),theory(equality)],[9,15]),
[iquote('0:Res:9.0,15.0')] ).
cnf(64,plain,
( ~ aElement0(xu)
| ~ aElement0(xv) ),
inference(mrr,[status(thm)],[61,62]),
[iquote('0:MRR:61.2,62.0')] ).
cnf(67,plain,
( ~ aSet0(xT)
| aElement0(xv) ),
inference(res,[status(thm),theory(equality)],[5,17]),
[iquote('0:Res:5.0,17.1')] ).
cnf(68,plain,
( ~ aSet0(xT)
| aElement0(xu) ),
inference(res,[status(thm),theory(equality)],[4,17]),
[iquote('0:Res:4.0,17.1')] ).
cnf(71,plain,
aElement0(xv),
inference(ssi,[status(thm)],[67,1]),
[iquote('0:SSi:67.0,1.0')] ).
cnf(72,plain,
~ aElement0(xu),
inference(mrr,[status(thm)],[64,71]),
[iquote('0:MRR:64.1,71.0')] ).
cnf(73,plain,
aElement0(xu),
inference(ssi,[status(thm)],[68,1]),
[iquote('0:SSi:68.0,1.0')] ).
cnf(74,plain,
$false,
inference(mrr,[status(thm)],[73,72]),
[iquote('0:MRR:73.0,72.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : LAT382+3 : TPTP v8.1.0. Released v4.0.0.
% 0.03/0.13 % Command : run_spass %d %s
% 0.13/0.34 % Computer : n029.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 : Wed Jun 29 12:20:22 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.19/0.48
% 0.19/0.48 SPASS V 3.9
% 0.19/0.48 SPASS beiseite: Proof found.
% 0.19/0.48 % SZS status Theorem
% 0.19/0.48 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.48 SPASS derived 18 clauses, backtracked 0 clauses, performed 2 splits and kept 64 clauses.
% 0.19/0.48 SPASS allocated 98158 KBytes.
% 0.19/0.48 SPASS spent 0:00:00.13 on the problem.
% 0.19/0.48 0:00:00.04 for the input.
% 0.19/0.48 0:00:00.07 for the FLOTTER CNF translation.
% 0.19/0.48 0:00:00.00 for inferences.
% 0.19/0.48 0:00:00.00 for the backtracking.
% 0.19/0.48 0:00:00.00 for the reduction.
% 0.19/0.48
% 0.19/0.48
% 0.19/0.48 Here is a proof with depth 1, length 21 :
% 0.19/0.48 % SZS output start Refutation
% See solution above
% 0.19/0.48 Formulae used in the proof : m__773 m__792 m__ mEOfElem mASymm
% 0.19/0.48
%------------------------------------------------------------------------------