TSTP Solution File: GEO024-3 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : GEO024-3 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n027.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:21:40 EDT 2022
% Result : Unsatisfiable 0.17s 0.40s
% Output : Refutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 2
% Number of leaves : 4
% Syntax : Number of clauses : 7 ( 6 unt; 0 nHn; 7 RR)
% Number of literals : 8 ( 0 equ; 3 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-4 aty)
% Number of functors : 7 ( 7 usr; 6 con; 0-4 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(8,axiom,
( ~ equidistant(u,v,w,x)
| equidistant(x,w,v,u) ),
file('GEO024-3.p',unknown),
[] ).
cnf(10,axiom,
equal(extension(u,v,w,w),v),
file('GEO024-3.p',unknown),
[] ).
cnf(17,axiom,
~ equidistant(u__dfg,u__dfg,v__dfg,v__dfg),
file('GEO024-3.p',unknown),
[] ).
cnf(22,axiom,
equidistant(u,extension(v,u,w,x),w,x),
file('GEO024-3.p',unknown),
[] ).
cnf(39,plain,
~ equidistant(v__dfg,v__dfg,u__dfg,u__dfg),
inference(res,[status(thm),theory(equality)],[8,17]),
[iquote('0:Res:8.1,17.0')] ).
cnf(67,plain,
equidistant(u,u,v,v),
inference(spr,[status(thm),theory(equality)],[10,22]),
[iquote('0:SpR:10.0,22.0')] ).
cnf(70,plain,
$false,
inference(unc,[status(thm)],[67,39]),
[iquote('0:UnC:67.0,39.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : GEO024-3 : TPTP v8.1.0. Released v1.0.0.
% 0.11/0.12 % Command : run_spass %d %s
% 0.11/0.33 % Computer : n027.cluster.edu
% 0.11/0.33 % Model : x86_64 x86_64
% 0.11/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.33 % Memory : 8042.1875MB
% 0.11/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33 % CPULimit : 300
% 0.11/0.33 % WCLimit : 600
% 0.11/0.33 % DateTime : Sat Jun 18 14:30:53 EDT 2022
% 0.11/0.33 % CPUTime :
% 0.17/0.40
% 0.17/0.40 SPASS V 3.9
% 0.17/0.40 SPASS beiseite: Proof found.
% 0.17/0.40 % SZS status Theorem
% 0.17/0.40 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.17/0.40 SPASS derived 32 clauses, backtracked 0 clauses, performed 0 splits and kept 44 clauses.
% 0.17/0.40 SPASS allocated 63151 KBytes.
% 0.17/0.40 SPASS spent 0:00:00.06 on the problem.
% 0.17/0.40 0:00:00.04 for the input.
% 0.17/0.40 0:00:00.00 for the FLOTTER CNF translation.
% 0.17/0.40 0:00:00.00 for inferences.
% 0.17/0.40 0:00:00.00 for the backtracking.
% 0.17/0.40 0:00:00.00 for the reduction.
% 0.17/0.40
% 0.17/0.40
% 0.17/0.40 Here is a proof with depth 1, length 7 :
% 0.17/0.40 % SZS output start Refutation
% See solution above
% 0.17/0.40 Formulae used in the proof : d4_5 e1 prove_congruence segment_construction2
% 0.17/0.40
%------------------------------------------------------------------------------