TSTP Solution File: GEO219+3 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : GEO219+3 : TPTP v8.1.0. Released v4.0.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:23:36 EDT 2022
% Result : Theorem 0.15s 0.39s
% Output : Refutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 12
% Syntax : Number of clauses : 25 ( 13 unt; 6 nHn; 25 RR)
% Number of literals : 40 ( 0 equ; 17 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 6 ( 5 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,
orthogonal_lines(skc5,skc3),
file('GEO219+3.p',unknown),
[] ).
cnf(2,axiom,
parallel_lines(skc5,skc4),
file('GEO219+3.p',unknown),
[] ).
cnf(3,axiom,
~ orthogonal_lines(skc3,skc4),
file('GEO219+3.p',unknown),
[] ).
cnf(12,axiom,
( unorthogonal_lines(u,v)
| convergent_lines(u,v) ),
file('GEO219+3.p',unknown),
[] ).
cnf(13,axiom,
( skP1(u,v)
| convergent_lines(v,u) ),
file('GEO219+3.p',unknown),
[] ).
cnf(14,axiom,
( skP1(u,v)
| unorthogonal_lines(v,u) ),
file('GEO219+3.p',unknown),
[] ).
cnf(19,axiom,
( orthogonal_lines(u,v)
| unorthogonal_lines(u,v) ),
file('GEO219+3.p',unknown),
[] ).
cnf(25,axiom,
( ~ convergent_lines(u,v)
| ~ parallel_lines(u,v) ),
file('GEO219+3.p',unknown),
[] ).
cnf(27,axiom,
( ~ unorthogonal_lines(u,v)
| ~ orthogonal_lines(u,v) ),
file('GEO219+3.p',unknown),
[] ).
cnf(30,axiom,
( ~ convergent_lines(u,v)
| convergent_lines(v,w)
| convergent_lines(u,w) ),
file('GEO219+3.p',unknown),
[] ).
cnf(43,axiom,
( ~ skP1(u,v)
| ~ skP1(w,v)
| skP1(u,w) ),
file('GEO219+3.p',unknown),
[] ).
cnf(44,axiom,
( ~ unorthogonal_lines(u,v)
| ~ convergent_lines(u,v)
| ~ skP1(v,u) ),
file('GEO219+3.p',unknown),
[] ).
cnf(50,plain,
~ convergent_lines(skc5,skc4),
inference(res,[status(thm),theory(equality)],[2,25]),
[iquote('0:Res:2.0,25.0')] ).
cnf(51,plain,
~ unorthogonal_lines(skc5,skc3),
inference(res,[status(thm),theory(equality)],[1,27]),
[iquote('0:Res:1.0,27.0')] ).
cnf(52,plain,
unorthogonal_lines(skc3,skc4),
inference(res,[status(thm),theory(equality)],[19,3]),
[iquote('0:Res:19.1,3.0')] ).
cnf(60,plain,
skP1(skc3,skc5),
inference(res,[status(thm),theory(equality)],[14,51]),
[iquote('0:Res:14.1,51.0')] ).
cnf(64,plain,
skP1(skc4,skc5),
inference(res,[status(thm),theory(equality)],[13,50]),
[iquote('0:Res:13.1,50.0')] ).
cnf(67,plain,
convergent_lines(skc5,skc3),
inference(res,[status(thm),theory(equality)],[12,51]),
[iquote('0:Res:12.0,51.0')] ).
cnf(154,plain,
( convergent_lines(skc3,u)
| convergent_lines(skc5,u) ),
inference(res,[status(thm),theory(equality)],[67,30]),
[iquote('0:Res:67.0,30.0')] ).
cnf(180,plain,
( ~ skP1(u,skc5)
| skP1(skc4,u) ),
inference(res,[status(thm),theory(equality)],[64,43]),
[iquote('0:Res:64.0,43.0')] ).
cnf(192,plain,
( ~ convergent_lines(skc3,skc4)
| ~ skP1(skc4,skc3) ),
inference(res,[status(thm),theory(equality)],[52,44]),
[iquote('0:Res:52.0,44.0')] ).
cnf(200,plain,
skP1(skc4,skc3),
inference(res,[status(thm),theory(equality)],[60,180]),
[iquote('0:Res:60.0,180.0')] ).
cnf(202,plain,
~ convergent_lines(skc3,skc4),
inference(mrr,[status(thm)],[192,200]),
[iquote('0:MRR:192.1,200.0')] ).
cnf(205,plain,
convergent_lines(skc5,skc4),
inference(res,[status(thm),theory(equality)],[154,202]),
[iquote('0:Res:154.0,202.0')] ).
cnf(207,plain,
$false,
inference(mrr,[status(thm)],[205,50]),
[iquote('0:MRR:205.0,50.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.10 % Problem : GEO219+3 : TPTP v8.1.0. Released v4.0.0.
% 0.10/0.10 % Command : run_spass %d %s
% 0.10/0.30 % Computer : n032.cluster.edu
% 0.10/0.30 % Model : x86_64 x86_64
% 0.10/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.30 % Memory : 8042.1875MB
% 0.10/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.30 % CPULimit : 300
% 0.10/0.30 % WCLimit : 600
% 0.10/0.30 % DateTime : Sat Jun 18 10:05:01 EDT 2022
% 0.10/0.30 % CPUTime :
% 0.15/0.39
% 0.15/0.39 SPASS V 3.9
% 0.15/0.39 SPASS beiseite: Proof found.
% 0.15/0.39 % SZS status Theorem
% 0.15/0.39 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.15/0.39 SPASS derived 153 clauses, backtracked 0 clauses, performed 0 splits and kept 149 clauses.
% 0.15/0.39 SPASS allocated 97742 KBytes.
% 0.15/0.39 SPASS spent 0:00:00.08 on the problem.
% 0.15/0.39 0:00:00.03 for the input.
% 0.15/0.39 0:00:00.02 for the FLOTTER CNF translation.
% 0.15/0.39 0:00:00.00 for inferences.
% 0.15/0.39 0:00:00.00 for the backtracking.
% 0.15/0.39 0:00:00.00 for the reduction.
% 0.15/0.39
% 0.15/0.39
% 0.15/0.39 Here is a proof with depth 4, length 25 :
% 0.15/0.39 % SZS output start Refutation
% See solution above
% 0.15/0.39 Formulae used in the proof : con coipo1 cotno1 a5 a3 ax6
% 0.15/0.39
%------------------------------------------------------------------------------