TSTP Solution File: GEO218+1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : GEO218+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n007.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:23:34 EDT 2022
% Result : Theorem 0.20s 0.46s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 10
% Syntax : Number of clauses : 22 ( 11 unt; 5 nHn; 22 RR)
% Number of literals : 36 ( 0 equ; 15 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 6 con; 0-0 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
unorthogonal_lines(skc3,skc4),
file('GEO218+1.p',unknown),
[] ).
cnf(2,axiom,
~ convergent_lines(skc5,skc3),
file('GEO218+1.p',unknown),
[] ).
cnf(3,axiom,
~ unorthogonal_lines(skc5,skc4),
file('GEO218+1.p',unknown),
[] ).
cnf(6,axiom,
~ convergent_lines(u,u),
file('GEO218+1.p',unknown),
[] ).
cnf(7,axiom,
( unorthogonal_lines(u,v)
| convergent_lines(u,v) ),
file('GEO218+1.p',unknown),
[] ).
cnf(8,axiom,
( skP0(u,v)
| convergent_lines(v,u) ),
file('GEO218+1.p',unknown),
[] ).
cnf(9,axiom,
( skP0(u,v)
| unorthogonal_lines(v,u) ),
file('GEO218+1.p',unknown),
[] ).
cnf(12,axiom,
( ~ convergent_lines(u,v)
| convergent_lines(v,w)
| convergent_lines(u,w) ),
file('GEO218+1.p',unknown),
[] ).
cnf(21,axiom,
( ~ skP0(u,v)
| ~ skP0(w,v)
| skP0(u,w) ),
file('GEO218+1.p',unknown),
[] ).
cnf(22,axiom,
( ~ unorthogonal_lines(u,v)
| ~ convergent_lines(u,v)
| ~ skP0(v,u) ),
file('GEO218+1.p',unknown),
[] ).
cnf(24,plain,
( ~ convergent_lines(skc3,skc4)
| ~ skP0(skc4,skc3) ),
inference(res,[status(thm),theory(equality)],[1,22]),
[iquote('0:Res:1.0,22.2')] ).
cnf(25,plain,
convergent_lines(skc5,skc4),
inference(res,[status(thm),theory(equality)],[7,3]),
[iquote('0:Res:7.1,3.0')] ).
cnf(26,plain,
skP0(skc4,skc5),
inference(res,[status(thm),theory(equality)],[9,3]),
[iquote('0:Res:9.0,3.0')] ).
cnf(30,plain,
skP0(skc3,skc5),
inference(res,[status(thm),theory(equality)],[8,2]),
[iquote('0:Res:8.0,2.0')] ).
cnf(31,plain,
( ~ convergent_lines(skc5,u)
| convergent_lines(u,skc3) ),
inference(res,[status(thm),theory(equality)],[12,2]),
[iquote('0:Res:12.1,2.0')] ).
cnf(45,plain,
convergent_lines(skc4,skc3),
inference(res,[status(thm),theory(equality)],[25,31]),
[iquote('0:Res:25.0,31.0')] ).
cnf(138,plain,
( convergent_lines(skc3,u)
| convergent_lines(skc4,u) ),
inference(res,[status(thm),theory(equality)],[45,12]),
[iquote('0:Res:45.0,12.0')] ).
cnf(148,plain,
( ~ skP0(skc4,skc3)
| convergent_lines(skc4,skc4) ),
inference(res,[status(thm),theory(equality)],[138,24]),
[iquote('0:Res:138.0,24.0')] ).
cnf(149,plain,
~ skP0(skc4,skc3),
inference(mrr,[status(thm)],[148,6]),
[iquote('0:MRR:148.1,6.0')] ).
cnf(154,plain,
( ~ skP0(u,skc5)
| skP0(skc4,u) ),
inference(res,[status(thm),theory(equality)],[26,21]),
[iquote('0:Res:26.0,21.0')] ).
cnf(163,plain,
skP0(skc4,skc3),
inference(res,[status(thm),theory(equality)],[30,154]),
[iquote('0:Res:30.0,154.0')] ).
cnf(166,plain,
$false,
inference(mrr,[status(thm)],[163,149]),
[iquote('0:MRR:163.0,149.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13 % Problem : GEO218+1 : TPTP v8.1.0. Released v3.3.0.
% 0.13/0.14 % Command : run_spass %d %s
% 0.13/0.35 % Computer : n007.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 : Sat Jun 18 18:09:43 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.20/0.46
% 0.20/0.46 SPASS V 3.9
% 0.20/0.46 SPASS beiseite: Proof found.
% 0.20/0.46 % SZS status Theorem
% 0.20/0.46 Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.20/0.46 SPASS derived 133 clauses, backtracked 0 clauses, performed 0 splits and kept 100 clauses.
% 0.20/0.46 SPASS allocated 85162 KBytes.
% 0.20/0.46 SPASS spent 0:00:00.09 on the problem.
% 0.20/0.46 0:00:00.03 for the input.
% 0.20/0.46 0:00:00.03 for the FLOTTER CNF translation.
% 0.20/0.46 0:00:00.00 for inferences.
% 0.20/0.46 0:00:00.00 for the backtracking.
% 0.20/0.46 0:00:00.01 for the reduction.
% 0.20/0.46
% 0.20/0.46
% 0.20/0.46 Here is a proof with depth 4, length 22 :
% 0.20/0.46 % SZS output start Refutation
% See solution above
% 0.20/0.46 Formulae used in the proof : con apart3 coipo1 cotno1 ax6
% 0.20/0.46
%------------------------------------------------------------------------------