TSTP Solution File: GEO305+1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : GEO305+1 : TPTP v8.1.0. Released v4.1.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n032.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 : Sat Jul 16 06:24:14 EDT 2022
% Result : Theorem 2.35s 2.56s
% Output : Refutation 2.35s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 10
% Syntax : Number of clauses : 16 ( 11 unt; 0 nHn; 16 RR)
% Number of literals : 37 ( 0 equ; 26 neg)
% Maximal clause size : 8 ( 2 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 6 ( 5 usr; 1 prp; 0-3 aty)
% Number of functors : 9 ( 9 usr; 9 con; 0-0 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
rpoint(vd1303),
file('GEO305+1.p',unknown),
[] ).
cnf(3,axiom,
rline(vd1297),
file('GEO305+1.p',unknown),
[] ).
cnf(5,axiom,
rpoint(vd1289),
file('GEO305+1.p',unknown),
[] ).
cnf(7,axiom,
rpoint(vd1287),
file('GEO305+1.p',unknown),
[] ).
cnf(12,axiom,
equal(vd1303,vd1302),
file('GEO305+1.p',unknown),
[] ).
cnf(13,axiom,
ron(vd1289,vd1297),
file('GEO305+1.p',unknown),
[] ).
cnf(14,axiom,
ron(vd1287,vd1297),
file('GEO305+1.p',unknown),
[] ).
cnf(23,axiom,
~ ron(vd1302,vd1297),
file('GEO305+1.p',unknown),
[] ).
cnf(24,axiom,
rR(vd1289,vd1287,vd1302),
file('GEO305+1.p',unknown),
[] ).
cnf(189,axiom,
( ~ rline(u)
| ~ rpoint(v)
| ~ rpoint(w)
| ~ rpoint(x)
| ~ ron(x,u)
| ~ ron(w,u)
| ~ rR(w,x,v)
| ron(v,u) ),
file('GEO305+1.p',unknown),
[] ).
cnf(267,plain,
rpoint(vd1302),
inference(rew,[status(thm),theory(equality)],[12,1]),
[iquote('0:Rew:12.0,1.0')] ).
cnf(325,plain,
( ~ rpoint(u)
| ~ rpoint(v)
| ~ rpoint(vd1302)
| ~ rline(vd1297)
| ~ ron(v,vd1297)
| ~ ron(u,vd1297)
| ~ rR(v,u,vd1302) ),
inference(res,[status(thm),theory(equality)],[189,23]),
[iquote('0:Res:189.7,23.0')] ).
cnf(355,plain,
( ~ rpoint(u)
| ~ rpoint(v)
| ~ ron(v,vd1297)
| ~ ron(u,vd1297)
| ~ rR(u,v,vd1302) ),
inference(mrr,[status(thm)],[325,267,3]),
[iquote('0:MRR:325.2,325.3,267.0,3.0')] ).
cnf(1020,plain,
( ~ rpoint(vd1289)
| ~ rpoint(vd1287)
| ~ ron(vd1287,vd1297)
| ~ ron(vd1289,vd1297) ),
inference(res,[status(thm),theory(equality)],[24,355]),
[iquote('0:Res:24.0,355.4')] ).
cnf(1021,plain,
( ~ ron(vd1287,vd1297)
| ~ ron(vd1289,vd1297) ),
inference(ssi,[status(thm)],[1020,7,5]),
[iquote('0:SSi:1020.1,1020.0,7.0,5.0')] ).
cnf(1022,plain,
$false,
inference(mrr,[status(thm)],[1021,14,13]),
[iquote('0:MRR:1021.0,1021.1,14.0,13.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.09 % Problem : GEO305+1 : TPTP v8.1.0. Released v4.1.0.
% 0.00/0.10 % Command : run_spass %d %s
% 0.09/0.28 % Computer : n032.cluster.edu
% 0.09/0.28 % Model : x86_64 x86_64
% 0.09/0.28 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.28 % Memory : 8042.1875MB
% 0.09/0.28 % OS : Linux 3.10.0-693.el7.x86_64
% 0.09/0.28 % CPULimit : 300
% 0.09/0.28 % WCLimit : 600
% 0.09/0.28 % DateTime : Sat Jun 18 10:57:31 EDT 2022
% 0.09/0.29 % CPUTime :
% 2.35/2.56
% 2.35/2.56 SPASS V 3.9
% 2.35/2.56 SPASS beiseite: Proof found.
% 2.35/2.56 % SZS status Theorem
% 2.35/2.56 Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.35/2.56 SPASS derived 432 clauses, backtracked 0 clauses, performed 0 splits and kept 409 clauses.
% 2.35/2.56 SPASS allocated 110511 KBytes.
% 2.35/2.56 SPASS spent 0:00:02.26 on the problem.
% 2.35/2.56 0:00:00.03 for the input.
% 2.35/2.56 0:00:01.94 for the FLOTTER CNF translation.
% 2.35/2.56 0:00:00.01 for inferences.
% 2.35/2.56 0:00:00.00 for the backtracking.
% 2.35/2.56 0:00:00.16 for the reduction.
% 2.35/2.56
% 2.35/2.56
% 2.35/2.56 Here is a proof with depth 2, length 16 :
% 2.35/2.56 % SZS output start Refutation
% See solution above
% 2.35/2.56 Formulae used in the proof : and_a40_pred_a40_conjunct2_a40_348_a41__a44__a32_4_a41__a44__a32_and_a40_holds_a40_conjunct2_a40_348_a41__a44__a32_1304_a44__a32_0_a41__a44__a32_and_a40_pred_a40_conjunct2_a40_348_a41__a44__a32_1_a41__a44__a32_holds_a40_conjunct1_a40_348_a41__a44__a32_1301_a44__a32_0_a41__a41__a41__a41_ pred_a40_347_a44__a32_0_a41_ and_a40_holds_a40_conjunct2_a40_345_a41__a44__a32_1294_a44__a32_0_a41__a44__a32_and_a40_pred_a40_conjunct1_a40_345_a41__a44__a32_9_a41__a44__a32_and_a40_pred_a40_conjunct1_a40_345_a41__a44__a32_8_a41__a44__a32_and_a40_pred_a40_conjunct1_a40_345_a41__a44__a32_7_a41__a44__a32_and_a40_qe_a40_s3_a40_plural_a40_345_a41__a41__a41__a44__a32_and_a40_qe_a40_s2_a40_plural_a40_345_a41__a41__a41__a44__a32_qe_a40_s1_a40_plural_a40_345_a41__a41__a41__a41__a41__a41__a41__a41__a41_ pred_a40_s2_a40_plural_a40_347_a41__a41__a44__a32_0_a41_ pred_a40_s1_a40_plural_a40_347_a41__a41__a44__a32_0_a41_ pred_a40_conjunct2_a40_349_a41__a44__a32_0_a41_ qu_a40_cond_a40_axiom_a40_83_a41__a44__a32_0_a41__a44__a32_imp_a40_cond_a40_axiom_a40_83_a41__a44__a32_0_a41__a41__a41_
% 2.35/2.56
%------------------------------------------------------------------------------