TSTP Solution File: COM016+4 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : COM016+4 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n005.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 : Fri Jul 15 01:44:18 EDT 2022
% Result : Theorem 0.19s 0.49s
% Output : Refutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 6
% Syntax : Number of clauses : 12 ( 6 unt; 2 nHn; 12 RR)
% Number of literals : 20 ( 0 equ; 11 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 5 ( 4 usr; 1 prp; 0-3 aty)
% Number of functors : 5 ( 5 usr; 5 con; 0-0 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(5,axiom,
aElement0(xb),
file('COM016+4.p',unknown),
[] ).
cnf(8,axiom,
aElement0(skc9),
file('COM016+4.p',unknown),
[] ).
cnf(32,axiom,
( aReductOfIn0(skc9,xa,xR)
| aReductOfIn0(xb,xa,xR) ),
file('COM016+4.p',unknown),
[] ).
cnf(33,axiom,
( sdtmndtplgtdt0(skc9,xR,xb)
| aReductOfIn0(xb,xa,xR) ),
file('COM016+4.p',unknown),
[] ).
cnf(42,axiom,
( ~ aElement0(u)
| ~ equal(u,xb)
| ~ aReductOfIn0(u,xa,xR) ),
file('COM016+4.p',unknown),
[] ).
cnf(44,axiom,
( ~ aElement0(u)
| ~ aReductOfIn0(u,xa,xR)
| ~ sdtmndtplgtdt0(u,xR,xb) ),
file('COM016+4.p',unknown),
[] ).
cnf(97,plain,
( ~ equal(xb,xb)
| ~ aReductOfIn0(xb,xa,xR) ),
inference(res,[status(thm),theory(equality)],[5,42]),
[iquote('0:Res:5.0,42.0')] ).
cnf(138,plain,
( ~ sdtmndtplgtdt0(skc9,xR,xb)
| ~ aReductOfIn0(skc9,xa,xR) ),
inference(res,[status(thm),theory(equality)],[8,44]),
[iquote('0:Res:8.0,44.0')] ).
cnf(184,plain,
~ aReductOfIn0(xb,xa,xR),
inference(obv,[status(thm),theory(equality)],[97]),
[iquote('0:Obv:97.0')] ).
cnf(185,plain,
sdtmndtplgtdt0(skc9,xR,xb),
inference(mrr,[status(thm)],[33,184]),
[iquote('0:MRR:33.1,184.0')] ).
cnf(186,plain,
aReductOfIn0(skc9,xa,xR),
inference(mrr,[status(thm)],[32,184]),
[iquote('0:MRR:32.1,184.0')] ).
cnf(189,plain,
$false,
inference(mrr,[status(thm)],[138,185,186]),
[iquote('0:MRR:138.0,138.1,185.0,186.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : COM016+4 : TPTP v8.1.0. Released v4.0.0.
% 0.00/0.12 % Command : run_spass %d %s
% 0.12/0.33 % Computer : n005.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 : Thu Jun 16 17:29:23 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.19/0.49
% 0.19/0.49 SPASS V 3.9
% 0.19/0.49 SPASS beiseite: Proof found.
% 0.19/0.49 % SZS status Theorem
% 0.19/0.49 Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.49 SPASS derived 92 clauses, backtracked 0 clauses, performed 0 splits and kept 101 clauses.
% 0.19/0.49 SPASS allocated 98339 KBytes.
% 0.19/0.49 SPASS spent 0:00:00.15 on the problem.
% 0.19/0.49 0:00:00.03 for the input.
% 0.19/0.49 0:00:00.09 for the FLOTTER CNF translation.
% 0.19/0.49 0:00:00.00 for inferences.
% 0.19/0.49 0:00:00.00 for the backtracking.
% 0.19/0.49 0:00:00.01 for the reduction.
% 0.19/0.49
% 0.19/0.49
% 0.19/0.49 Here is a proof with depth 1, length 12 :
% 0.19/0.49 % SZS output start Refutation
% See solution above
% 0.19/0.49 Formulae used in the proof : m__731 m__731_02 m__
% 0.19/0.49
%------------------------------------------------------------------------------