TSTP Solution File: GEO557+1 by SPASS---3.9

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SPASS---3.9
% Problem  : GEO557+1 : TPTP v8.1.0. Released v7.5.0.
% Transfm  : none
% Format   : tptp
% Command  : run_spass %d %s

% Computer : n013.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:25:13 EDT 2022

% Result   : Theorem 14.57s 14.78s
% Output   : Refutation 14.57s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :   13
% Syntax   : Number of clauses     :   29 (  10 unt;   2 nHn;  29 RR)
%            Number of literals    :   54 (   0 equ;  25 neg)
%            Maximal clause size   :    3 (   1 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    7 (   6 usr;   1 prp; 0-8 aty)
%            Number of functors    :   16 (  16 usr;  15 con; 0-2 aty)
%            Number of variables   :    0 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(4,axiom,
    circle(skc21,skc20,skc14,skc22),
    file('GEO557+1.p',unknown),
    [] ).

cnf(9,axiom,
    ~ cyclic(skc14,skc12,skc19,skc18),
    file('GEO557+1.p',unknown),
    [] ).

cnf(19,axiom,
    ( ~ perp(u,v,w,x)
    | perp(w,x,u,v) ),
    file('GEO557+1.p',unknown),
    [] ).

cnf(22,axiom,
    ( ~ cyclic(u,v,w,x)
    | cyclic(v,u,w,x) ),
    file('GEO557+1.p',unknown),
    [] ).

cnf(26,axiom,
    ( ~ circle(u,v,w,x)
    | perp(skf31(u,v),v,v,u) ),
    file('GEO557+1.p',unknown),
    [] ).

cnf(34,axiom,
    ( ~ eqangle(u,v,w,x,y,z,w,x)
    | para(u,v,y,z) ),
    file('GEO557+1.p',unknown),
    [] ).

cnf(35,axiom,
    ( ~ para(u,v,w,x)
    | eqangle(u,v,y,z,w,x,y,z) ),
    file('GEO557+1.p',unknown),
    [] ).

cnf(45,axiom,
    ( ~ perp(u,v,w,x)
    | ~ perp(y,z,u,v)
    | para(y,z,w,x) ),
    file('GEO557+1.p',unknown),
    [] ).

cnf(48,axiom,
    ( ~ cyclic(u,v,w,x)
    | ~ cyclic(u,v,w,y)
    | cyclic(v,w,y,x) ),
    file('GEO557+1.p',unknown),
    [] ).

cnf(56,axiom,
    ( ~ eqangle(u,v,w,x,y,z,x1,x2)
    | eqangle(w,x,u,v,x1,x2,y,z) ),
    file('GEO557+1.p',unknown),
    [] ).

cnf(58,axiom,
    ( ~ eqangle(u,v,w,x,y,z,x1,x2)
    | eqangle(u,v,y,z,w,x,x1,x2) ),
    file('GEO557+1.p',unknown),
    [] ).

cnf(63,axiom,
    ( ~ eqangle(u,v,u,w,x,v,x,w)
    | coll(u,x,v)
    | cyclic(v,w,u,x) ),
    file('GEO557+1.p',unknown),
    [] ).

cnf(80,axiom,
    ( ~ coll(u,v,w)
    | ~ eqangle(u,x,u,w,v,x,v,w)
    | cyclic(x,w,u,v) ),
    file('GEO557+1.p',unknown),
    [] ).

cnf(214,plain,
    perp(skf31(skc21,skc20),skc20,skc20,skc21),
    inference(res,[status(thm),theory(equality)],[4,26]),
    [iquote('0:Res:4.0,26.0')] ).

cnf(229,plain,
    ~ cyclic(skc12,skc14,skc19,skc18),
    inference(res,[status(thm),theory(equality)],[22,9]),
    [iquote('0:Res:22.1,9.0')] ).

cnf(314,plain,
    perp(skc20,skc21,skf31(skc21,skc20),skc20),
    inference(res,[status(thm),theory(equality)],[214,19]),
    [iquote('0:Res:214.0,19.0')] ).

cnf(752,plain,
    ( ~ perp(u,v,skf31(skc21,skc20),skc20)
    | para(u,v,skc20,skc21) ),
    inference(res,[status(thm),theory(equality)],[214,45]),
    [iquote('0:Res:214.0,45.0')] ).

cnf(1283,plain,
    ( ~ para(u,v,w,x)
    | eqangle(u,v,w,x,y,z,y,z) ),
    inference(res,[status(thm),theory(equality)],[35,58]),
    [iquote('0:Res:35.1,58.0')] ).

cnf(1315,plain,
    ( ~ para(u,v,w,x)
    | eqangle(y,z,u,v,y,z,w,x) ),
    inference(res,[status(thm),theory(equality)],[35,56]),
    [iquote('0:Res:35.1,56.0')] ).

cnf(4716,plain,
    ( ~ para(u,v,u,v)
    | coll(u,w,v)
    | cyclic(v,v,u,w) ),
    inference(res,[status(thm),theory(equality)],[1283,63]),
    [iquote('0:Res:1283.1,63.0')] ).

cnf(4727,plain,
    ( ~ para(u,v,u,v)
    | ~ coll(u,w,v)
    | cyclic(v,v,u,w) ),
    inference(res,[status(thm),theory(equality)],[1283,80]),
    [iquote('0:Res:1283.1,80.1')] ).

cnf(4741,plain,
    ( ~ para(u,v,u,v)
    | cyclic(v,v,u,w) ),
    inference(mrr,[status(thm)],[4727,4716]),
    [iquote('0:MRR:4727.1,4716.1')] ).

cnf(5179,plain,
    ( ~ para(u,v,u,v)
    | para(w,x,w,x) ),
    inference(res,[status(thm),theory(equality)],[1315,34]),
    [iquote('0:Res:1315.1,34.0')] ).

cnf(19945,plain,
    para(skc20,skc21,skc20,skc21),
    inference(res,[status(thm),theory(equality)],[314,752]),
    [iquote('0:Res:314.0,752.0')] ).

cnf(19963,plain,
    para(u,v,u,v),
    inference(res,[status(thm),theory(equality)],[19945,5179]),
    [iquote('0:Res:19945.0,5179.0')] ).

cnf(19979,plain,
    cyclic(u,u,v,w),
    inference(mrr,[status(thm)],[4741,19963]),
    [iquote('0:MRR:4741.0,19963.0')] ).

cnf(22847,plain,
    ( ~ cyclic(u,u,v,w)
    | cyclic(u,v,w,x) ),
    inference(res,[status(thm),theory(equality)],[19979,48]),
    [iquote('0:Res:19979.0,48.0')] ).

cnf(23353,plain,
    cyclic(u,v,w,x),
    inference(mrr,[status(thm)],[22847,19979]),
    [iquote('0:MRR:22847.0,19979.0')] ).

cnf(23354,plain,
    $false,
    inference(unc,[status(thm)],[23353,229]),
    [iquote('0:UnC:23353.0,229.0')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13  % Problem  : GEO557+1 : TPTP v8.1.0. Released v7.5.0.
% 0.07/0.13  % Command  : run_spass %d %s
% 0.14/0.35  % Computer : n013.cluster.edu
% 0.14/0.35  % Model    : x86_64 x86_64
% 0.14/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35  % Memory   : 8042.1875MB
% 0.14/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35  % CPULimit : 300
% 0.14/0.35  % WCLimit  : 600
% 0.14/0.35  % DateTime : Sat Jun 18 11:01:59 EDT 2022
% 0.14/0.35  % CPUTime  : 
% 14.57/14.78  
% 14.57/14.78  SPASS V 3.9 
% 14.57/14.78  SPASS beiseite: Proof found.
% 14.57/14.78  % SZS status Theorem
% 14.57/14.78  Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p 
% 14.57/14.78  SPASS derived 21638 clauses, backtracked 0 clauses, performed 6 splits and kept 12396 clauses.
% 14.57/14.78  SPASS allocated 101567 KBytes.
% 14.57/14.78  SPASS spent	0:0:14.14 on the problem.
% 14.57/14.78  		0:00:00.04 for the input.
% 14.57/14.78  		0:00:00.22 for the FLOTTER CNF translation.
% 14.57/14.78  		0:00:00.32 for inferences.
% 14.57/14.78  		0:00:00.01 for the backtracking.
% 14.57/14.78  		0:0:13.24 for the reduction.
% 14.57/14.78  
% 14.57/14.78  
% 14.57/14.78  Here is a proof with depth 4, length 29 :
% 14.57/14.78  % SZS output start Refutation
% See solution above
% 14.57/14.79  Formulae used in the proof : exemplo6GDDFULL012017 ruleD8 ruleD16 ruleX11 ruleD39 ruleD40 ruleD9 ruleD17 ruleD19 ruleD21 ruleD42a ruleD42b
% 14.57/14.79  
%------------------------------------------------------------------------------