TSTP Solution File: CSR067+3 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : CSR067+3 : TPTP v8.1.0. Released v3.4.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n026.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 28.24s 28.57s
% Output : Refutation 28.24s
% 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+3.p',unknown),
[] ).
cnf(2296,axiom,
~ borderson(u,c_georegion_l4_x29_y75),
file('CSR067+3.p',unknown),
[] ).
cnf(4009,axiom,
( ~ mtvisible(c_tptpgeo_member7_mt)
| borderson(c_georegion_l4_x29_y75,c_georegion_l4_x29_y76) ),
file('CSR067+3.p',unknown),
[] ).
cnf(7202,axiom,
( ~ borderson(u,v)
| borderson(v,u) ),
file('CSR067+3.p',unknown),
[] ).
cnf(8008,plain,
borderson(c_georegion_l4_x29_y75,c_georegion_l4_x29_y76),
inference(mrr,[status(thm)],[4009,1]),
[iquote('0:MRR:4009.0,1.0')] ).
cnf(8030,plain,
borderson(c_georegion_l4_x29_y76,c_georegion_l4_x29_y75),
inference(res,[status(thm),theory(equality)],[8008,7202]),
[iquote('0:Res:8008.0,7202.0')] ).
cnf(8121,plain,
$false,
inference(mrr,[status(thm)],[8030,2296]),
[iquote('0:MRR:8030.0,2296.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : CSR067+3 : TPTP v8.1.0. Released v3.4.0.
% 0.11/0.13 % Command : run_spass %d %s
% 0.13/0.34 % Computer : n026.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 : Fri Jun 10 02:16:03 EDT 2022
% 0.13/0.35 % CPUTime :
% 28.24/28.57
% 28.24/28.57 SPASS V 3.9
% 28.24/28.57 SPASS beiseite: Proof found.
% 28.24/28.57 % SZS status Theorem
% 28.24/28.57 Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 28.24/28.57 SPASS derived 92 clauses, backtracked 0 clauses, performed 0 splits and kept 7277 clauses.
% 28.24/28.57 SPASS allocated 112725 KBytes.
% 28.24/28.57 SPASS spent 0:0:26.42 on the problem.
% 28.24/28.57 0:00:00.10 for the input.
% 28.24/28.57 0:00:07.15 for the FLOTTER CNF translation.
% 28.24/28.57 0:00:00.00 for inferences.
% 28.24/28.57 0:00:00.00 for the backtracking.
% 28.24/28.57 0:00:07.56 for the reduction.
% 28.24/28.57
% 28.24/28.57
% 28.24/28.57 Here is a proof with depth 1, length 7 :
% 28.24/28.57 % SZS output start Refutation
% See solution above
% 28.24/28.57 Formulae used in the proof : query167 ax2_4223 ax2_7642
% 28.24/28.57
%------------------------------------------------------------------------------