TSTP Solution File: GEO217+1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : GEO217+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n018.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:33 EDT 2022
% Result : Theorem 0.19s 0.44s
% Output : Refutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 5
% Syntax : Number of clauses : 12 ( 8 unt; 2 nHn; 12 RR)
% Number of literals : 17 ( 0 equ; 8 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 2 ( 1 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,
convergent_lines(skc3,skc4),
file('GEO217+1.p',unknown),
[] ).
cnf(2,axiom,
~ convergent_lines(skc5,skc3),
file('GEO217+1.p',unknown),
[] ).
cnf(3,axiom,
~ convergent_lines(skc5,skc4),
file('GEO217+1.p',unknown),
[] ).
cnf(6,axiom,
~ convergent_lines(u,u),
file('GEO217+1.p',unknown),
[] ).
cnf(12,axiom,
( ~ convergent_lines(u,v)
| convergent_lines(v,w)
| convergent_lines(u,w) ),
file('GEO217+1.p',unknown),
[] ).
cnf(24,plain,
( convergent_lines(skc4,u)
| convergent_lines(skc3,u) ),
inference(res,[status(thm),theory(equality)],[1,12]),
[iquote('0:Res:1.0,12.0')] ).
cnf(34,plain,
( ~ convergent_lines(u,skc5)
| convergent_lines(u,skc4) ),
inference(res,[status(thm),theory(equality)],[12,3]),
[iquote('0:Res:12.2,3.0')] ).
cnf(39,plain,
( ~ convergent_lines(u,skc5)
| convergent_lines(u,skc3) ),
inference(res,[status(thm),theory(equality)],[12,2]),
[iquote('0:Res:12.2,2.0')] ).
cnf(62,plain,
~ convergent_lines(skc3,skc5),
inference(res,[status(thm),theory(equality)],[39,6]),
[iquote('0:Res:39.1,6.0')] ).
cnf(65,plain,
convergent_lines(skc4,skc5),
inference(res,[status(thm),theory(equality)],[24,62]),
[iquote('0:Res:24.1,62.0')] ).
cnf(68,plain,
~ convergent_lines(skc4,skc5),
inference(res,[status(thm),theory(equality)],[34,6]),
[iquote('0:Res:34.1,6.0')] ).
cnf(71,plain,
$false,
inference(mrr,[status(thm)],[68,65]),
[iquote('0:MRR:68.0,65.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : GEO217+1 : TPTP v8.1.0. Released v3.3.0.
% 0.12/0.13 % Command : run_spass %d %s
% 0.12/0.33 % Computer : n018.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 19:12:17 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.19/0.44
% 0.19/0.44 SPASS V 3.9
% 0.19/0.44 SPASS beiseite: Proof found.
% 0.19/0.44 % SZS status Theorem
% 0.19/0.44 Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.44 SPASS derived 47 clauses, backtracked 0 clauses, performed 0 splits and kept 47 clauses.
% 0.19/0.44 SPASS allocated 85156 KBytes.
% 0.19/0.44 SPASS spent 0:00:00.09 on the problem.
% 0.19/0.44 0:00:00.04 for the input.
% 0.19/0.44 0:00:00.03 for the FLOTTER CNF translation.
% 0.19/0.44 0:00:00.00 for inferences.
% 0.19/0.44 0:00:00.00 for the backtracking.
% 0.19/0.44 0:00:00.00 for the reduction.
% 0.19/0.44
% 0.19/0.44
% 0.19/0.44 Here is a proof with depth 3, length 12 :
% 0.19/0.44 % SZS output start Refutation
% See solution above
% 0.19/0.44 Formulae used in the proof : con apart3 ax6
% 0.19/0.44
%------------------------------------------------------------------------------