TSTP Solution File: LAT381+1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : LAT381+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n012.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:46 EDT 2022
% Result : Theorem 0.19s 0.47s
% Output : Refutation 0.19s
% 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('LAT381+1.p',unknown),
[] ).
cnf(2,axiom,
aSubsetOf0(xS,xT),
file('LAT381+1.p',unknown),
[] ).
cnf(3,axiom,
~ equal(xv,xu),
file('LAT381+1.p',unknown),
[] ).
cnf(4,axiom,
aSupremumOfIn0(xu,xS,xT),
file('LAT381+1.p',unknown),
[] ).
cnf(5,axiom,
aSupremumOfIn0(xv,xS,xT),
file('LAT381+1.p',unknown),
[] ).
cnf(7,axiom,
( ~ aSet0(u)
| ~ aElementOf0(v,u)
| aElement0(v) ),
file('LAT381+1.p',unknown),
[] ).
cnf(17,axiom,
( ~ aSet0(u)
| ~ aSubsetOf0(v,u)
| ~ aSupremumOfIn0(w,v,u)
| aElementOf0(w,u) ),
file('LAT381+1.p',unknown),
[] ).
cnf(19,axiom,
( ~ aSet0(u)
| ~ aSubsetOf0(v,u)
| ~ aSupremumOfIn0(w,v,u)
| aUpperBoundOfIn0(w,v,u) ),
file('LAT381+1.p',unknown),
[] ).
cnf(20,axiom,
( ~ aElement0(u)
| ~ aElement0(v)
| ~ sdtlseqdt0(v,u)
| ~ sdtlseqdt0(u,v)
| equal(v,u) ),
file('LAT381+1.p',unknown),
[] ).
cnf(23,axiom,
( ~ aSet0(u)
| ~ aSubsetOf0(v,u)
| ~ aUpperBoundOfIn0(w,v,u)
| ~ aSupremumOfIn0(x,v,u)
| sdtlseqdt0(x,w) ),
file('LAT381+1.p',unknown),
[] ).
cnf(38,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(89,plain,
( ~ aSet0(xT)
| ~ aSubsetOf0(xS,xT)
| aElementOf0(xv,xT) ),
inference(res,[status(thm),theory(equality)],[5,17]),
[iquote('0:Res:5.0,17.2')] ).
cnf(90,plain,
( ~ aSet0(xT)
| ~ aSubsetOf0(xS,xT)
| aElementOf0(xu,xT) ),
inference(res,[status(thm),theory(equality)],[4,17]),
[iquote('0:Res:4.0,17.2')] ).
cnf(91,plain,
( ~ aSubsetOf0(xS,xT)
| aElementOf0(xv,xT) ),
inference(ssi,[status(thm)],[89,1]),
[iquote('0:SSi:89.0,1.0')] ).
cnf(92,plain,
aElementOf0(xv,xT),
inference(mrr,[status(thm)],[91,2]),
[iquote('0:MRR:91.0,2.0')] ).
cnf(93,plain,
( ~ aSubsetOf0(xS,xT)
| aElementOf0(xu,xT) ),
inference(ssi,[status(thm)],[90,1]),
[iquote('0:SSi:90.0,1.0')] ).
cnf(94,plain,
aElementOf0(xu,xT),
inference(mrr,[status(thm)],[93,2]),
[iquote('0:MRR:93.0,2.0')] ).
cnf(96,plain,
( ~ aSet0(xT)
| aElement0(xv) ),
inference(res,[status(thm),theory(equality)],[92,7]),
[iquote('0:Res:92.0,7.1')] ).
cnf(98,plain,
aElement0(xv),
inference(ssi,[status(thm)],[96,1]),
[iquote('0:SSi:96.0,1.0')] ).
cnf(99,plain,
( ~ aElement0(xu)
| ~ sdtlseqdt0(xv,xu)
| ~ sdtlseqdt0(xu,xv) ),
inference(mrr,[status(thm)],[38,98]),
[iquote('0:MRR:38.1,98.0')] ).
cnf(102,plain,
( ~ aSet0(xT)
| aElement0(xu) ),
inference(res,[status(thm),theory(equality)],[94,7]),
[iquote('0:Res:94.0,7.1')] ).
cnf(104,plain,
aElement0(xu),
inference(ssi,[status(thm)],[102,1]),
[iquote('0:SSi:102.0,1.0')] ).
cnf(105,plain,
( ~ sdtlseqdt0(xv,xu)
| ~ sdtlseqdt0(xu,xv) ),
inference(mrr,[status(thm)],[99,104]),
[iquote('0:MRR:99.0,104.0')] ).
cnf(173,plain,
( ~ aSet0(xT)
| ~ aSubsetOf0(xS,xT)
| aUpperBoundOfIn0(xv,xS,xT) ),
inference(res,[status(thm),theory(equality)],[5,19]),
[iquote('0:Res:5.0,19.2')] ).
cnf(174,plain,
( ~ aSet0(xT)
| ~ aSubsetOf0(xS,xT)
| aUpperBoundOfIn0(xu,xS,xT) ),
inference(res,[status(thm),theory(equality)],[4,19]),
[iquote('0:Res:4.0,19.2')] ).
cnf(175,plain,
( ~ aSubsetOf0(xS,xT)
| aUpperBoundOfIn0(xv,xS,xT) ),
inference(ssi,[status(thm)],[173,1]),
[iquote('0:SSi:173.0,1.0')] ).
cnf(176,plain,
aUpperBoundOfIn0(xv,xS,xT),
inference(mrr,[status(thm)],[175,2]),
[iquote('0:MRR:175.0,2.0')] ).
cnf(177,plain,
( ~ aSubsetOf0(xS,xT)
| aUpperBoundOfIn0(xu,xS,xT) ),
inference(ssi,[status(thm)],[174,1]),
[iquote('0:SSi:174.0,1.0')] ).
cnf(178,plain,
aUpperBoundOfIn0(xu,xS,xT),
inference(mrr,[status(thm)],[177,2]),
[iquote('0:MRR:177.0,2.0')] ).
cnf(366,plain,
( ~ aSet0(xT)
| ~ aSubsetOf0(xS,xT)
| ~ aSupremumOfIn0(u,xS,xT)
| sdtlseqdt0(u,xv) ),
inference(res,[status(thm),theory(equality)],[176,23]),
[iquote('0:Res:176.0,23.2')] ).
cnf(367,plain,
( ~ aSet0(xT)
| ~ aSubsetOf0(xS,xT)
| ~ aSupremumOfIn0(u,xS,xT)
| sdtlseqdt0(u,xu) ),
inference(res,[status(thm),theory(equality)],[178,23]),
[iquote('0:Res:178.0,23.2')] ).
cnf(368,plain,
( ~ aSubsetOf0(xS,xT)
| ~ aSupremumOfIn0(u,xS,xT)
| sdtlseqdt0(u,xv) ),
inference(ssi,[status(thm)],[366,1]),
[iquote('0:SSi:366.0,1.0')] ).
cnf(369,plain,
( ~ aSupremumOfIn0(u,xS,xT)
| sdtlseqdt0(u,xv) ),
inference(mrr,[status(thm)],[368,2]),
[iquote('0:MRR:368.0,2.0')] ).
cnf(370,plain,
( ~ aSubsetOf0(xS,xT)
| ~ aSupremumOfIn0(u,xS,xT)
| sdtlseqdt0(u,xu) ),
inference(ssi,[status(thm)],[367,1]),
[iquote('0:SSi:367.0,1.0')] ).
cnf(371,plain,
( ~ aSupremumOfIn0(u,xS,xT)
| sdtlseqdt0(u,xu) ),
inference(mrr,[status(thm)],[370,2]),
[iquote('0:MRR:370.0,2.0')] ).
cnf(373,plain,
sdtlseqdt0(xu,xv),
inference(res,[status(thm),theory(equality)],[4,369]),
[iquote('0:Res:4.0,369.0')] ).
cnf(374,plain,
~ sdtlseqdt0(xv,xu),
inference(mrr,[status(thm)],[105,373]),
[iquote('0:MRR:105.1,373.0')] ).
cnf(391,plain,
sdtlseqdt0(xv,xu),
inference(res,[status(thm),theory(equality)],[5,371]),
[iquote('0:Res:5.0,371.0')] ).
cnf(393,plain,
$false,
inference(mrr,[status(thm)],[391,374]),
[iquote('0:MRR:391.0,374.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : LAT381+1 : TPTP v8.1.0. Released v4.0.0.
% 0.11/0.12 % Command : run_spass %d %s
% 0.13/0.32 % Computer : n012.cluster.edu
% 0.13/0.32 % Model : x86_64 x86_64
% 0.13/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.32 % Memory : 8042.1875MB
% 0.13/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.32 % CPULimit : 300
% 0.13/0.32 % WCLimit : 600
% 0.13/0.32 % DateTime : Wed Jun 29 19:56:48 EDT 2022
% 0.13/0.33 % CPUTime :
% 0.19/0.47
% 0.19/0.47 SPASS V 3.9
% 0.19/0.47 SPASS beiseite: Proof found.
% 0.19/0.47 % SZS status Theorem
% 0.19/0.47 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.47 SPASS derived 214 clauses, backtracked 47 clauses, performed 6 splits and kept 181 clauses.
% 0.19/0.47 SPASS allocated 104170 KBytes.
% 0.19/0.47 SPASS spent 0:00:00.13 on the problem.
% 0.19/0.47 0:00:00.04 for the input.
% 0.19/0.47 0:00:00.05 for the FLOTTER CNF translation.
% 0.19/0.47 0:00:00.00 for inferences.
% 0.19/0.47 0:00:00.00 for the backtracking.
% 0.19/0.47 0:00:00.02 for the reduction.
% 0.19/0.47
% 0.19/0.47
% 0.19/0.47 Here is a proof with depth 3, length 39 :
% 0.19/0.47 % SZS output start Refutation
% See solution above
% 0.19/0.47 Formulae used in the proof : m__725 m__725_01 m__ m__744 mEOfElem mDefSup mASymm
% 0.19/0.47
%------------------------------------------------------------------------------