TSTP Solution File: LAT382+1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : LAT382+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n008.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.20s 0.48s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 10
% Syntax : Number of clauses : 39 ( 15 unt; 0 nHn; 39 RR)
% Number of literals : 87 ( 0 equ; 53 neg)
% Maximal clause size : 5 ( 2 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 9 ( 8 usr; 1 prp; 0-3 aty)
% Number of functors : 8 ( 8 usr; 8 con; 0-0 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
aSet0(xT),
file('LAT382+1.p',unknown),
[] ).
cnf(2,axiom,
aSubsetOf0(xS,xT),
file('LAT382+1.p',unknown),
[] ).
cnf(3,axiom,
~ equal(xv,xu),
file('LAT382+1.p',unknown),
[] ).
cnf(4,axiom,
aInfimumOfIn0(xu,xS,xT),
file('LAT382+1.p',unknown),
[] ).
cnf(5,axiom,
aInfimumOfIn0(xv,xS,xT),
file('LAT382+1.p',unknown),
[] ).
cnf(7,axiom,
( ~ aSet0(u)
| ~ aElementOf0(v,u)
| aElement0(v) ),
file('LAT382+1.p',unknown),
[] ).
cnf(16,axiom,
( ~ aSet0(u)
| ~ aSubsetOf0(v,u)
| ~ aInfimumOfIn0(w,v,u)
| aElementOf0(w,u) ),
file('LAT382+1.p',unknown),
[] ).
cnf(18,axiom,
( ~ aSet0(u)
| ~ aSubsetOf0(v,u)
| ~ aInfimumOfIn0(w,v,u)
| aLowerBoundOfIn0(w,v,u) ),
file('LAT382+1.p',unknown),
[] ).
cnf(20,axiom,
( ~ aElement0(u)
| ~ aElement0(v)
| ~ sdtlseqdt0(v,u)
| ~ sdtlseqdt0(u,v)
| equal(v,u) ),
file('LAT382+1.p',unknown),
[] ).
cnf(25,axiom,
( ~ aSet0(u)
| ~ aSubsetOf0(v,u)
| ~ aLowerBoundOfIn0(w,v,u)
| ~ aInfimumOfIn0(x,v,u)
| sdtlseqdt0(w,x) ),
file('LAT382+1.p',unknown),
[] ).
cnf(39,plain,
( ~ aElement0(xu)
| ~ aElement0(xv)
| ~ sdtlseqdt0(xv,xu)
| ~ sdtlseqdt0(xu,xv) ),
inference(res,[status(thm),theory(equality)],[20,3]),
[iquote('0:Res:20.4,3.0')] ).
cnf(88,plain,
( ~ aSet0(xT)
| ~ aSubsetOf0(xS,xT)
| aElementOf0(xv,xT) ),
inference(res,[status(thm),theory(equality)],[5,16]),
[iquote('0:Res:5.0,16.2')] ).
cnf(89,plain,
( ~ aSet0(xT)
| ~ aSubsetOf0(xS,xT)
| aElementOf0(xu,xT) ),
inference(res,[status(thm),theory(equality)],[4,16]),
[iquote('0:Res:4.0,16.2')] ).
cnf(90,plain,
( ~ aSubsetOf0(xS,xT)
| aElementOf0(xv,xT) ),
inference(ssi,[status(thm)],[88,1]),
[iquote('0:SSi:88.0,1.0')] ).
cnf(91,plain,
aElementOf0(xv,xT),
inference(mrr,[status(thm)],[90,2]),
[iquote('0:MRR:90.0,2.0')] ).
cnf(92,plain,
( ~ aSubsetOf0(xS,xT)
| aElementOf0(xu,xT) ),
inference(ssi,[status(thm)],[89,1]),
[iquote('0:SSi:89.0,1.0')] ).
cnf(93,plain,
aElementOf0(xu,xT),
inference(mrr,[status(thm)],[92,2]),
[iquote('0:MRR:92.0,2.0')] ).
cnf(95,plain,
( ~ aSet0(xT)
| aElement0(xv) ),
inference(res,[status(thm),theory(equality)],[91,7]),
[iquote('0:Res:91.0,7.1')] ).
cnf(97,plain,
aElement0(xv),
inference(ssi,[status(thm)],[95,1]),
[iquote('0:SSi:95.0,1.0')] ).
cnf(98,plain,
( ~ aElement0(xu)
| ~ sdtlseqdt0(xv,xu)
| ~ sdtlseqdt0(xu,xv) ),
inference(mrr,[status(thm)],[39,97]),
[iquote('0:MRR:39.1,97.0')] ).
cnf(101,plain,
( ~ aSet0(xT)
| aElement0(xu) ),
inference(res,[status(thm),theory(equality)],[93,7]),
[iquote('0:Res:93.0,7.1')] ).
cnf(103,plain,
aElement0(xu),
inference(ssi,[status(thm)],[101,1]),
[iquote('0:SSi:101.0,1.0')] ).
cnf(104,plain,
( ~ sdtlseqdt0(xv,xu)
| ~ sdtlseqdt0(xu,xv) ),
inference(mrr,[status(thm)],[98,103]),
[iquote('0:MRR:98.0,103.0')] ).
cnf(155,plain,
( ~ aSet0(xT)
| ~ aSubsetOf0(xS,xT)
| aLowerBoundOfIn0(xv,xS,xT) ),
inference(res,[status(thm),theory(equality)],[5,18]),
[iquote('0:Res:5.0,18.2')] ).
cnf(156,plain,
( ~ aSet0(xT)
| ~ aSubsetOf0(xS,xT)
| aLowerBoundOfIn0(xu,xS,xT) ),
inference(res,[status(thm),theory(equality)],[4,18]),
[iquote('0:Res:4.0,18.2')] ).
cnf(157,plain,
( ~ aSubsetOf0(xS,xT)
| aLowerBoundOfIn0(xv,xS,xT) ),
inference(ssi,[status(thm)],[155,1]),
[iquote('0:SSi:155.0,1.0')] ).
cnf(158,plain,
aLowerBoundOfIn0(xv,xS,xT),
inference(mrr,[status(thm)],[157,2]),
[iquote('0:MRR:157.0,2.0')] ).
cnf(159,plain,
( ~ aSubsetOf0(xS,xT)
| aLowerBoundOfIn0(xu,xS,xT) ),
inference(ssi,[status(thm)],[156,1]),
[iquote('0:SSi:156.0,1.0')] ).
cnf(160,plain,
aLowerBoundOfIn0(xu,xS,xT),
inference(mrr,[status(thm)],[159,2]),
[iquote('0:MRR:159.0,2.0')] ).
cnf(350,plain,
( ~ aSet0(xT)
| ~ aSubsetOf0(xS,xT)
| ~ aInfimumOfIn0(u,xS,xT)
| sdtlseqdt0(xv,u) ),
inference(res,[status(thm),theory(equality)],[158,25]),
[iquote('0:Res:158.0,25.2')] ).
cnf(351,plain,
( ~ aSet0(xT)
| ~ aSubsetOf0(xS,xT)
| ~ aInfimumOfIn0(u,xS,xT)
| sdtlseqdt0(xu,u) ),
inference(res,[status(thm),theory(equality)],[160,25]),
[iquote('0:Res:160.0,25.2')] ).
cnf(353,plain,
( ~ aSubsetOf0(xS,xT)
| ~ aInfimumOfIn0(u,xS,xT)
| sdtlseqdt0(xv,u) ),
inference(ssi,[status(thm)],[350,1]),
[iquote('0:SSi:350.0,1.0')] ).
cnf(354,plain,
( ~ aInfimumOfIn0(u,xS,xT)
| sdtlseqdt0(xv,u) ),
inference(mrr,[status(thm)],[353,2]),
[iquote('0:MRR:353.0,2.0')] ).
cnf(355,plain,
( ~ aSubsetOf0(xS,xT)
| ~ aInfimumOfIn0(u,xS,xT)
| sdtlseqdt0(xu,u) ),
inference(ssi,[status(thm)],[351,1]),
[iquote('0:SSi:351.0,1.0')] ).
cnf(356,plain,
( ~ aInfimumOfIn0(u,xS,xT)
| sdtlseqdt0(xu,u) ),
inference(mrr,[status(thm)],[355,2]),
[iquote('0:MRR:355.0,2.0')] ).
cnf(360,plain,
sdtlseqdt0(xv,xu),
inference(res,[status(thm),theory(equality)],[4,354]),
[iquote('0:Res:4.0,354.0')] ).
cnf(361,plain,
~ sdtlseqdt0(xu,xv),
inference(mrr,[status(thm)],[104,360]),
[iquote('0:MRR:104.0,360.0')] ).
cnf(371,plain,
sdtlseqdt0(xu,xv),
inference(res,[status(thm),theory(equality)],[5,356]),
[iquote('0:Res:5.0,356.0')] ).
cnf(373,plain,
$false,
inference(mrr,[status(thm)],[371,361]),
[iquote('0:MRR:371.0,361.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : LAT382+1 : TPTP v8.1.0. Released v4.0.0.
% 0.07/0.13 % Command : run_spass %d %s
% 0.13/0.34 % Computer : n008.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 : Tue Jun 28 19:15:38 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.20/0.48
% 0.20/0.48 SPASS V 3.9
% 0.20/0.48 SPASS beiseite: Proof found.
% 0.20/0.48 % SZS status Theorem
% 0.20/0.48 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.48 SPASS derived 183 clauses, backtracked 36 clauses, performed 6 splits and kept 161 clauses.
% 0.20/0.48 SPASS allocated 97925 KBytes.
% 0.20/0.48 SPASS spent 0:00:00.12 on the problem.
% 0.20/0.48 0:00:00.03 for the input.
% 0.20/0.48 0:00:00.04 for the FLOTTER CNF translation.
% 0.20/0.48 0:00:00.00 for inferences.
% 0.20/0.48 0:00:00.00 for the backtracking.
% 0.20/0.48 0:00:00.01 for the reduction.
% 0.20/0.48
% 0.20/0.48
% 0.20/0.48 Here is a proof with depth 3, length 39 :
% 0.20/0.48 % SZS output start Refutation
% See solution above
% 0.20/0.48 Formulae used in the proof : m__773 m__773_01 m__ m__792 mEOfElem mDefInf mASymm
% 0.20/0.48
%------------------------------------------------------------------------------