TSTP Solution File: CSR067+1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : CSR067+1 : TPTP v8.1.0. Released v3.4.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n028.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 23:24:57 EDT 2022
% Result : Theorem 0.20s 0.44s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 4
% Syntax : Number of clauses : 7 ( 5 unt; 0 nHn; 7 RR)
% Number of literals : 9 ( 0 equ; 3 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 5 con; 0-0 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
mtvisible(c_tptpgeo_member7_mt),
file('CSR067+1.p',unknown),
[] ).
cnf(3,axiom,
~ borderson(u,c_georegion_l4_x29_y75),
file('CSR067+1.p',unknown),
[] ).
cnf(5,axiom,
( ~ mtvisible(c_tptpgeo_member7_mt)
| borderson(c_georegion_l4_x29_y75,c_georegion_l4_x29_y76) ),
file('CSR067+1.p',unknown),
[] ).
cnf(23,axiom,
( ~ borderson(u,v)
| borderson(v,u) ),
file('CSR067+1.p',unknown),
[] ).
cnf(32,plain,
borderson(c_georegion_l4_x29_y75,c_georegion_l4_x29_y76),
inference(mrr,[status(thm)],[5,1]),
[iquote('0:MRR:5.0,1.0')] ).
cnf(33,plain,
borderson(c_georegion_l4_x29_y76,c_georegion_l4_x29_y75),
inference(res,[status(thm),theory(equality)],[32,23]),
[iquote('0:Res:32.0,23.0')] ).
cnf(37,plain,
$false,
inference(mrr,[status(thm)],[33,3]),
[iquote('0:MRR:33.0,3.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : CSR067+1 : TPTP v8.1.0. Released v3.4.0.
% 0.03/0.13 % Command : run_spass %d %s
% 0.13/0.35 % Computer : n028.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 600
% 0.13/0.35 % DateTime : Fri Jun 10 20:02:49 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.20/0.44
% 0.20/0.44 SPASS V 3.9
% 0.20/0.44 SPASS beiseite: Proof found.
% 0.20/0.44 % SZS status Theorem
% 0.20/0.44 Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.20/0.44 SPASS derived 4 clauses, backtracked 0 clauses, performed 0 splits and kept 28 clauses.
% 0.20/0.44 SPASS allocated 97618 KBytes.
% 0.20/0.44 SPASS spent 0:00:00.08 on the problem.
% 0.20/0.44 0:00:00.03 for the input.
% 0.20/0.44 0:00:00.03 for the FLOTTER CNF translation.
% 0.20/0.44 0:00:00.00 for inferences.
% 0.20/0.44 0:00:00.00 for the backtracking.
% 0.20/0.44 0:00:00.00 for the reduction.
% 0.20/0.44
% 0.20/0.44
% 0.20/0.44 Here is a proof with depth 1, length 7 :
% 0.20/0.44 % SZS output start Refutation
% See solution above
% 0.20/0.44 Formulae used in the proof : query67 just1 just28
% 0.20/0.44
%------------------------------------------------------------------------------