TSTP Solution File: GEO112+1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : GEO112+1 : TPTP v8.1.0. Released v2.4.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:22:26 EDT 2022
% Result : Theorem 0.63s 0.80s
% Output : Refutation 0.63s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 8
% Syntax : Number of clauses : 16 ( 8 unt; 1 nHn; 16 RR)
% Number of literals : 34 ( 0 equ; 22 neg)
% Maximal clause size : 6 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 6 ( 5 usr; 1 prp; 0-4 aty)
% Number of functors : 10 ( 10 usr; 9 con; 0-4 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(2,axiom,
between_c(skc4,skc5,skc6,skc7),
file('GEO112+1.p',unknown),
[] ).
cnf(7,axiom,
~ between_c(skc4,skc7,skc6,skc5),
file('GEO112+1.p',unknown),
[] ).
cnf(14,axiom,
part_of(skf25(u,v,w,x),x),
file('GEO112+1.p',unknown),
[] ).
cnf(25,axiom,
( ~ equal(u,v)
| ~ between_c(w,u,x,v) ),
file('GEO112+1.p',unknown),
[] ).
cnf(32,axiom,
( ~ between_c(u,v,w,x)
| end_point(v,skf25(w,x,v,u)) ),
file('GEO112+1.p',unknown),
[] ).
cnf(33,axiom,
( ~ between_c(u,v,w,x)
| end_point(x,skf25(w,x,v,u)) ),
file('GEO112+1.p',unknown),
[] ).
cnf(34,axiom,
( ~ between_c(u,v,w,x)
| inner_point(w,skf25(w,x,v,u)) ),
file('GEO112+1.p',unknown),
[] ).
cnf(47,axiom,
( ~ inner_point(u,v)
| ~ end_point(w,v)
| ~ end_point(x,v)
| ~ part_of(v,y)
| equal(x,w)
| between_c(y,x,u,w) ),
file('GEO112+1.p',unknown),
[] ).
cnf(51,plain,
~ equal(skc7,skc5),
inference(res,[status(thm),theory(equality)],[2,25]),
[iquote('0:Res:2.0,25.1')] ).
cnf(52,plain,
end_point(skc5,skf25(skc6,skc7,skc5,skc4)),
inference(res,[status(thm),theory(equality)],[2,32]),
[iquote('0:Res:2.0,32.0')] ).
cnf(53,plain,
end_point(skc7,skf25(skc6,skc7,skc5,skc4)),
inference(res,[status(thm),theory(equality)],[2,33]),
[iquote('0:Res:2.0,33.0')] ).
cnf(54,plain,
inner_point(skc6,skf25(skc6,skc7,skc5,skc4)),
inference(res,[status(thm),theory(equality)],[2,34]),
[iquote('0:Res:2.0,34.0')] ).
cnf(55,plain,
( ~ part_of(u,skc4)
| ~ end_point(skc7,u)
| ~ end_point(skc5,u)
| ~ inner_point(skc6,u)
| equal(skc7,skc5) ),
inference(res,[status(thm),theory(equality)],[47,7]),
[iquote('0:Res:47.4,7.0')] ).
cnf(56,plain,
( ~ part_of(u,skc4)
| ~ inner_point(skc6,u)
| ~ end_point(skc5,u)
| ~ end_point(skc7,u) ),
inference(mrr,[status(thm)],[55,51]),
[iquote('0:MRR:55.4,51.0')] ).
cnf(1361,plain,
( ~ part_of(skf25(skc6,skc7,skc5,skc4),skc4)
| ~ end_point(skc5,skf25(skc6,skc7,skc5,skc4))
| ~ end_point(skc7,skf25(skc6,skc7,skc5,skc4)) ),
inference(res,[status(thm),theory(equality)],[54,56]),
[iquote('0:Res:54.0,56.1')] ).
cnf(1364,plain,
$false,
inference(mrr,[status(thm)],[1361,14,52,53]),
[iquote('0:MRR:1361.0,1361.1,1361.2,14.0,52.0,53.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : GEO112+1 : TPTP v8.1.0. Released v2.4.0.
% 0.10/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 23:29:39 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.63/0.80
% 0.63/0.80 SPASS V 3.9
% 0.63/0.80 SPASS beiseite: Proof found.
% 0.63/0.80 % SZS status Theorem
% 0.63/0.80 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.63/0.80 SPASS derived 1277 clauses, backtracked 0 clauses, performed 0 splits and kept 1138 clauses.
% 0.63/0.80 SPASS allocated 99492 KBytes.
% 0.63/0.80 SPASS spent 0:00:00.45 on the problem.
% 0.63/0.80 0:00:00.03 for the input.
% 0.63/0.80 0:00:00.08 for the FLOTTER CNF translation.
% 0.63/0.80 0:00:00.02 for inferences.
% 0.63/0.80 0:00:00.00 for the backtracking.
% 0.63/0.80 0:00:00.29 for the reduction.
% 0.63/0.80
% 0.63/0.80
% 0.63/0.80 Here is a proof with depth 2, length 16 :
% 0.63/0.80 % SZS output start Refutation
% See solution above
% 0.63/0.80 Formulae used in the proof : theorem_3_8_2 between_c_defn part_of_defn
% 0.63/0.80
%------------------------------------------------------------------------------