TSTP Solution File: GEO343+1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : GEO343+1 : TPTP v8.1.0. Released v4.1.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 : Sat Jul 16 06:24:24 EDT 2022
% Result : Theorem 108.39s 108.62s
% Output : Refutation 108.39s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 11
% Syntax : Number of clauses : 16 ( 11 unt; 5 nHn; 16 RR)
% Number of literals : 47 ( 0 equ; 28 neg)
% Maximal clause size : 10 ( 2 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 5 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 8 con; 0-0 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
rline(skc1),
file('GEO343+1.p',unknown),
[] ).
cnf(2,axiom,
rline(vd1416),
file('GEO343+1.p',unknown),
[] ).
cnf(4,axiom,
rpoint(vd1401),
file('GEO343+1.p',unknown),
[] ).
cnf(6,axiom,
rpoint(vd1399),
file('GEO343+1.p',unknown),
[] ).
cnf(10,axiom,
ron(vd1399,skc1),
file('GEO343+1.p',unknown),
[] ).
cnf(11,axiom,
ron(vd1401,skc1),
file('GEO343+1.p',unknown),
[] ).
cnf(12,axiom,
ron(vd1399,vd1416),
file('GEO343+1.p',unknown),
[] ).
cnf(13,axiom,
ron(vd1401,vd1416),
file('GEO343+1.p',unknown),
[] ).
cnf(23,axiom,
~ equal(skc1,vd1416),
file('GEO343+1.p',unknown),
[] ).
cnf(25,axiom,
~ equal(vd1401,vd1399),
file('GEO343+1.p',unknown),
[] ).
cnf(212,axiom,
( ~ rline(u)
| ~ rline(v)
| ~ rpoint(w)
| ~ rpoint(x)
| ~ ron(x,v)
| ~ ron(x,u)
| ~ ron(w,u)
| ~ ron(w,v)
| equal(v,u)
| equal(x,w) ),
file('GEO343+1.p',unknown),
[] ).
cnf(522,plain,
( ~ rpoint(u)
| ~ rpoint(vd1401)
| ~ rline(skc1)
| ~ rline(v)
| ~ ron(vd1401,v)
| ~ ron(u,v)
| ~ ron(u,skc1)
| equal(u,vd1401)
| equal(skc1,v) ),
inference(res,[status(thm),theory(equality)],[11,212]),
[iquote('0:Res:11.0,212.4')] ).
cnf(680,plain,
( ~ rline(u)
| ~ rpoint(v)
| ~ ron(v,u)
| ~ ron(v,skc1)
| ~ ron(vd1401,u)
| equal(v,vd1401)
| equal(skc1,u) ),
inference(mrr,[status(thm)],[522,4,1]),
[iquote('0:MRR:522.1,522.2,4.0,1.0')] ).
cnf(30130,plain,
( ~ rline(vd1416)
| ~ rpoint(vd1399)
| ~ ron(vd1399,skc1)
| ~ ron(vd1401,vd1416)
| equal(vd1401,vd1399)
| equal(skc1,vd1416) ),
inference(res,[status(thm),theory(equality)],[12,680]),
[iquote('0:Res:12.0,680.2')] ).
cnf(30194,plain,
( ~ ron(vd1399,skc1)
| ~ ron(vd1401,vd1416)
| equal(vd1401,vd1399)
| equal(skc1,vd1416) ),
inference(ssi,[status(thm)],[30130,6,2]),
[iquote('0:SSi:30130.1,30130.0,6.0,2.0')] ).
cnf(30195,plain,
$false,
inference(mrr,[status(thm)],[30194,10,13,25,23]),
[iquote('0:MRR:30194.0,30194.1,30194.2,30194.3,10.0,13.0,25.0,23.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : GEO343+1 : TPTP v8.1.0. Released v4.1.0.
% 0.03/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 : Fri Jun 17 16:30:38 EDT 2022
% 0.12/0.33 % CPUTime :
% 108.39/108.62
% 108.39/108.62 SPASS V 3.9
% 108.39/108.62 SPASS beiseite: Proof found.
% 108.39/108.62 % SZS status Theorem
% 108.39/108.62 Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 108.39/108.62 SPASS derived 17717 clauses, backtracked 1 clauses, performed 2 splits and kept 6897 clauses.
% 108.39/108.62 SPASS allocated 137109 KBytes.
% 108.39/108.62 SPASS spent 0:1:44.32 on the problem.
% 108.39/108.62 0:00:00.04 for the input.
% 108.39/108.62 0:00:01.91 for the FLOTTER CNF translation.
% 108.39/108.62 0:00:00.48 for inferences.
% 108.39/108.62 0:00:00.19 for the backtracking.
% 108.39/108.62 0:1:40.61 for the reduction.
% 108.39/108.62
% 108.39/108.62
% 108.39/108.62 Here is a proof with depth 2, length 16 :
% 108.39/108.62 % SZS output start Refutation
% See solution above
% 108.39/108.62 Formulae used in the proof : qu_a40_theu_a40_the_a40_408_a41__a44__a32_1_a41__a44__a32_imp_a40_the_a40_408_a41__a41__a41_ and_a40_pred_a40_s2_a40_plural_a40_the_a40_408_a41__a41__a41__a44__a32_0_a41__a44__a32_and_a40_pred_a40_s1_a40_plural_a40_the_a40_408_a41__a41__a41__a44__a32_0_a41__a44__a32_pred_a40_the_a40_408_a41__a44__a32_0_a41__a41__a41_ and_a40_pred_a40_conjunct2_a40_405_a41__a44__a32_5_a41__a44__a32_and_a40_pred_a40_s2_a40_plural_a40_conjunct2_a40_405_a41__a41__a41__a44__a32_0_a41__a44__a32_and_a40_pred_a40_s1_a40_plural_a40_conjunct2_a40_405_a41__a41__a41__a44__a32_0_a41__a44__a32_and_a40_pred_a40_conjunct2_a40_405_a41__a44__a32_1_a41__a44__a32_and_a40_pred_a40_conjunct1_a40_405_a41__a44__a32_9_a41__a44__a32_and_a40_pred_a40_conjunct1_a40_405_a41__a44__a32_8_a41__a44__a32_and_a40_pred_a40_conjunct1_a40_405_a41__a44__a32_7_a41__a44__a32_and_a40_qe_a40_s3_a40_plural_a40_405_a41__a41__a41__a44__a32_and_a40_qe_a40_s2_a40_plural_a40_405_a41__a41__a41__a44__a32_qe_a40_s1_a40_plural_a40_405_a41__a41__a41__a41__a41__a41__a41__a41__a41__a41__a41__a41_ qu_a40_cond_a40_axiom_a40_73_a41__a44__a32_0_a41__a44__a32_imp_a40_cond_a40_axiom_a40_73_a41__a44__a32_0_a41__a41__a41_
% 108.39/108.62
%------------------------------------------------------------------------------