TSTP Solution File: LAT381+3 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : LAT381+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.20s 0.46s
% Output : Refutation 0.20s
% 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('LAT381+3.p',unknown),
[] ).
cnf(4,axiom,
aElementOf0(xu,xT),
file('LAT381+3.p',unknown),
[] ).
cnf(5,axiom,
aElementOf0(xv,xT),
file('LAT381+3.p',unknown),
[] ).
cnf(6,axiom,
~ equal(xv,xu),
file('LAT381+3.p',unknown),
[] ).
cnf(7,axiom,
aUpperBoundOfIn0(xu,xS,xT),
file('LAT381+3.p',unknown),
[] ).
cnf(9,axiom,
aUpperBoundOfIn0(xv,xS,xT),
file('LAT381+3.p',unknown),
[] ).
cnf(15,axiom,
( ~ aUpperBoundOfIn0(u,xS,xT)
| sdtlseqdt0(xu,u) ),
file('LAT381+3.p',unknown),
[] ).
cnf(16,axiom,
( ~ aUpperBoundOfIn0(u,xS,xT)
| sdtlseqdt0(xv,u) ),
file('LAT381+3.p',unknown),
[] ).
cnf(17,axiom,
( ~ aSet0(u)
| ~ aElementOf0(v,u)
| aElement0(v) ),
file('LAT381+3.p',unknown),
[] ).
cnf(34,axiom,
( ~ aElement0(u)
| ~ aElement0(v)
| ~ sdtlseqdt0(v,u)
| ~ sdtlseqdt0(u,v)
| equal(v,u) ),
file('LAT381+3.p',unknown),
[] ).
cnf(52,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(62,plain,
sdtlseqdt0(xv,xu),
inference(res,[status(thm),theory(equality)],[7,16]),
[iquote('0:Res:7.0,16.0')] ).
cnf(63,plain,
( ~ aElement0(xu)
| ~ aElement0(xv)
| ~ sdtlseqdt0(xu,xv) ),
inference(mrr,[status(thm)],[52,62]),
[iquote('0:MRR:52.2,62.0')] ).
cnf(64,plain,
sdtlseqdt0(xu,xv),
inference(res,[status(thm),theory(equality)],[9,15]),
[iquote('0:Res:9.0,15.0')] ).
cnf(66,plain,
( ~ aElement0(xu)
| ~ aElement0(xv) ),
inference(mrr,[status(thm)],[63,64]),
[iquote('0:MRR:63.2,64.0')] ).
cnf(69,plain,
( ~ aSet0(xT)
| aElement0(xv) ),
inference(res,[status(thm),theory(equality)],[5,17]),
[iquote('0:Res:5.0,17.1')] ).
cnf(70,plain,
( ~ aSet0(xT)
| aElement0(xu) ),
inference(res,[status(thm),theory(equality)],[4,17]),
[iquote('0:Res:4.0,17.1')] ).
cnf(73,plain,
aElement0(xv),
inference(ssi,[status(thm)],[69,1]),
[iquote('0:SSi:69.0,1.0')] ).
cnf(74,plain,
~ aElement0(xu),
inference(mrr,[status(thm)],[66,73]),
[iquote('0:MRR:66.1,73.0')] ).
cnf(75,plain,
aElement0(xu),
inference(ssi,[status(thm)],[70,1]),
[iquote('0:SSi:70.0,1.0')] ).
cnf(76,plain,
$false,
inference(mrr,[status(thm)],[75,74]),
[iquote('0:MRR:75.0,74.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.11 % Problem : LAT381+3 : TPTP v8.1.0. Released v4.0.0.
% 0.11/0.12 % Command : run_spass %d %s
% 0.13/0.33 % Computer : n029.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 600
% 0.13/0.33 % DateTime : Tue Jun 28 19:07:07 EDT 2022
% 0.13/0.33 % CPUTime :
% 0.20/0.46
% 0.20/0.46 SPASS V 3.9
% 0.20/0.46 SPASS beiseite: Proof found.
% 0.20/0.46 % SZS status Theorem
% 0.20/0.46 Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.20/0.46 SPASS derived 16 clauses, backtracked 0 clauses, performed 2 splits and kept 62 clauses.
% 0.20/0.46 SPASS allocated 104406 KBytes.
% 0.20/0.46 SPASS spent 0:00:00.12 on the problem.
% 0.20/0.46 0:00:00.04 for the input.
% 0.20/0.46 0:00:00.06 for the FLOTTER CNF translation.
% 0.20/0.46 0:00:00.00 for inferences.
% 0.20/0.46 0:00:00.00 for the backtracking.
% 0.20/0.46 0:00:00.00 for the reduction.
% 0.20/0.46
% 0.20/0.46
% 0.20/0.46 Here is a proof with depth 1, length 21 :
% 0.20/0.46 % SZS output start Refutation
% See solution above
% 0.20/0.46 Formulae used in the proof : m__725 m__744 m__ mEOfElem mASymm
% 0.20/0.46
%------------------------------------------------------------------------------