TSTP Solution File: GEO126+1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : GEO126+1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n026.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:33 EDT 2022
% Result : Theorem 0.47s 0.66s
% Output : Refutation 0.47s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 10
% Syntax : Number of clauses : 25 ( 12 unt; 2 nHn; 25 RR)
% Number of literals : 43 ( 0 equ; 19 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 9 ( 8 usr; 1 prp; 0-3 aty)
% Number of functors : 8 ( 8 usr; 4 con; 0-1 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
open(skf38(u)),
file('GEO126+1.p',unknown),
[] ).
cnf(2,axiom,
inner_point(skf30(u),u),
file('GEO126+1.p',unknown),
[] ).
cnf(3,axiom,
start_point(skf43(u),u),
file('GEO126+1.p',unknown),
[] ).
cnf(12,axiom,
( ~ end_point(u,v)
| incident_c(u,v) ),
file('GEO126+1.p',unknown),
[] ).
cnf(13,axiom,
( ~ inner_point(u,v)
| incident_c(u,v) ),
file('GEO126+1.p',unknown),
[] ).
cnf(15,axiom,
( ~ open(u)
| end_point(skf29(u),u) ),
file('GEO126+1.p',unknown),
[] ).
cnf(19,axiom,
( ~ ordered_by(skc1,u,v)
| equal(u,v) ),
file('GEO126+1.p',unknown),
[] ).
cnf(20,axiom,
( ~ inner_point(u,v)
| ~ end_point(u,v) ),
file('GEO126+1.p',unknown),
[] ).
cnf(26,axiom,
( ~ incident_c(u,skf38(v))
| incident_o(u,v) ),
file('GEO126+1.p',unknown),
[] ).
cnf(61,axiom,
( ~ start_point(u,v)
| ~ incident_o(w,v)
| equal(u,w)
| ordered_by(v,u,w) ),
file('GEO126+1.p',unknown),
[] ).
cnf(92,plain,
incident_c(skf30(u),u),
inference(res,[status(thm),theory(equality)],[2,13]),
[iquote('0:Res:2.0,13.0')] ).
cnf(94,plain,
( ~ open(u)
| incident_c(skf29(u),u) ),
inference(res,[status(thm),theory(equality)],[15,12]),
[iquote('0:Res:15.1,12.0')] ).
cnf(97,plain,
incident_o(skf30(skf38(u)),u),
inference(res,[status(thm),theory(equality)],[92,26]),
[iquote('0:Res:92.0,26.0')] ).
cnf(99,plain,
( ~ open(skf38(u))
| incident_o(skf29(skf38(u)),u) ),
inference(res,[status(thm),theory(equality)],[94,26]),
[iquote('0:Res:94.1,26.0')] ).
cnf(101,plain,
incident_o(skf29(skf38(u)),u),
inference(ssi,[status(thm)],[99,1]),
[iquote('0:SSi:99.0,1.0')] ).
cnf(102,plain,
~ end_point(skf30(u),u),
inference(res,[status(thm),theory(equality)],[2,20]),
[iquote('0:Res:2.0,20.0')] ).
cnf(369,plain,
( ~ start_point(u,skc1)
| ~ incident_o(v,skc1)
| equal(u,v)
| equal(u,v) ),
inference(res,[status(thm),theory(equality)],[61,19]),
[iquote('0:Res:61.3,19.0')] ).
cnf(374,plain,
( ~ start_point(u,skc1)
| ~ incident_o(v,skc1)
| equal(u,v) ),
inference(obv,[status(thm),theory(equality)],[369]),
[iquote('0:Obv:369.2')] ).
cnf(744,plain,
( ~ incident_o(u,skc1)
| equal(skf43(skc1),u) ),
inference(res,[status(thm),theory(equality)],[3,374]),
[iquote('0:Res:3.0,374.0')] ).
cnf(747,plain,
equal(skf30(skf38(skc1)),skf43(skc1)),
inference(res,[status(thm),theory(equality)],[97,744]),
[iquote('0:Res:97.0,744.0')] ).
cnf(761,plain,
equal(skf29(skf38(skc1)),skf43(skc1)),
inference(res,[status(thm),theory(equality)],[101,744]),
[iquote('0:Res:101.0,744.0')] ).
cnf(826,plain,
~ end_point(skf43(skc1),skf38(skc1)),
inference(spl,[status(thm),theory(equality)],[747,102]),
[iquote('0:SpL:747.0,102.0')] ).
cnf(850,plain,
( ~ open(skf38(skc1))
| end_point(skf43(skc1),skf38(skc1)) ),
inference(spr,[status(thm),theory(equality)],[761,15]),
[iquote('0:SpR:761.0,15.1')] ).
cnf(854,plain,
end_point(skf43(skc1),skf38(skc1)),
inference(ssi,[status(thm)],[850,1]),
[iquote('0:SSi:850.0,1.0')] ).
cnf(855,plain,
$false,
inference(mrr,[status(thm)],[854,826]),
[iquote('0:MRR:854.0,826.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : GEO126+1 : TPTP v8.1.0. Released v2.4.0.
% 0.13/0.13 % Command : run_spass %d %s
% 0.14/0.34 % Computer : n026.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 600
% 0.14/0.34 % DateTime : Sat Jun 18 04:26:24 EDT 2022
% 0.14/0.34 % CPUTime :
% 0.47/0.66
% 0.47/0.66 SPASS V 3.9
% 0.47/0.66 SPASS beiseite: Proof found.
% 0.47/0.66 % SZS status Theorem
% 0.47/0.66 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.47/0.66 SPASS derived 745 clauses, backtracked 0 clauses, performed 0 splits and kept 752 clauses.
% 0.47/0.66 SPASS allocated 98774 KBytes.
% 0.47/0.66 SPASS spent 0:00:00.30 on the problem.
% 0.47/0.66 0:00:00.03 for the input.
% 0.47/0.66 0:00:00.08 for the FLOTTER CNF translation.
% 0.47/0.66 0:00:00.01 for inferences.
% 0.47/0.66 0:00:00.00 for the backtracking.
% 0.47/0.66 0:00:00.14 for the reduction.
% 0.47/0.66
% 0.47/0.66
% 0.47/0.66 Here is a proof with depth 4, length 25 :
% 0.47/0.66 % SZS output start Refutation
% See solution above
% 0.47/0.66 Formulae used in the proof : o2 c3 o4 end_point_defn part_of_defn inner_point_defn open_defn theorem_4_11 start_point_defn
% 0.47/0.66
%------------------------------------------------------------------------------