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

View Problem - Process Solution

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

% Computer : n019.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:24:21 EDT 2022

% Result   : Theorem 2.21s 2.36s
% Output   : Refutation 2.21s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :   10
% Syntax   : Number of clauses     :   15 (   9 unt;   6 nHn;  15 RR)
%            Number of literals    :   56 (   0 equ;  28 neg)
%            Maximal clause size   :   10 (   3 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    4 (   3 usr;   1 prp; 0-2 aty)
%            Number of functors    :    8 (   8 usr;   6 con; 0-3 aty)
%            Number of variables   :    0 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(1,axiom,
    rpoint(vd1354),
    file('GEO331+1.p',unknown),
    [] ).

cnf(2,axiom,
    rpoint(vd1353),
    file('GEO331+1.p',unknown),
    [] ).

cnf(3,axiom,
    rpoint(vd1352),
    file('GEO331+1.p',unknown),
    [] ).

cnf(12,axiom,
    ~ equal(vd1354,vd1353),
    file('GEO331+1.p',unknown),
    [] ).

cnf(13,axiom,
    ~ equal(vd1354,vd1352),
    file('GEO331+1.p',unknown),
    [] ).

cnf(14,axiom,
    ~ equal(vd1353,vd1352),
    file('GEO331+1.p',unknown),
    [] ).

cnf(59,axiom,
    ~ equal(vf(vd1352,vd1354),vf(vd1352,vd1353)),
    file('GEO331+1.p',unknown),
    [] ).

cnf(67,axiom,
    equal(vangle(vd1352,vd1354,vd1353),vangle(vd1352,vd1353,vd1354)),
    file('GEO331+1.p',unknown),
    [] ).

cnf(216,axiom,
    ( ~ rpoint(u)
    | ~ rpoint(v)
    | ~ rpoint(w)
    | ~ equal(vangle(u,v,w),vangle(u,w,v))
    | ~ rless(vf(u,w),vf(u,v))
    | equal(u,w)
    | equal(u,v)
    | equal(vf(u,v),vf(u,w))
    | equal(v,w) ),
    file('GEO331+1.p',unknown),
    [] ).

cnf(223,axiom,
    ( ~ rpoint(u)
    | ~ rpoint(v)
    | ~ rpoint(w)
    | ~ equal(vangle(u,v,w),vangle(u,w,v))
    | equal(u,w)
    | equal(u,v)
    | equal(vf(u,v),vf(u,w))
    | rless(vf(u,v),vf(u,w))
    | rless(vf(u,w),vf(u,v))
    | equal(v,w) ),
    file('GEO331+1.p',unknown),
    [] ).

cnf(283,plain,
    ( ~ rpoint(u)
    | ~ rpoint(v)
    | ~ rpoint(w)
    | ~ equal(vangle(w,v,u),vangle(w,u,v))
    | equal(v,u)
    | equal(w,v)
    | equal(w,u)
    | equal(vf(w,v),vf(w,u)) ),
    inference(mrr,[status(thm)],[223,216]),
    [iquote('0:MRR:223.7,223.8,216.4,216.4')] ).

cnf(446,plain,
    ( ~ rpoint(vd1352)
    | ~ rpoint(vd1353)
    | ~ rpoint(vd1354)
    | ~ equal(vangle(vd1352,vd1354,vd1353),vangle(vd1352,vd1353,vd1354))
    | equal(vd1354,vd1352)
    | equal(vd1353,vd1352)
    | equal(vd1354,vd1353) ),
    inference(res,[status(thm),theory(equality)],[283,59]),
    [iquote('0:Res:283.6,59.0')] ).

cnf(582,plain,
    ( ~ rpoint(vd1352)
    | ~ rpoint(vd1353)
    | ~ rpoint(vd1354)
    | ~ equal(vangle(vd1352,vd1353,vd1354),vangle(vd1352,vd1353,vd1354))
    | equal(vd1354,vd1352)
    | equal(vd1353,vd1352)
    | equal(vd1354,vd1353) ),
    inference(rew,[status(thm),theory(equality)],[67,446]),
    [iquote('0:Rew:67.0,446.3')] ).

cnf(583,plain,
    ( ~ rpoint(vd1352)
    | ~ rpoint(vd1353)
    | ~ rpoint(vd1354)
    | equal(vd1354,vd1352)
    | equal(vd1353,vd1352)
    | equal(vd1354,vd1353) ),
    inference(obv,[status(thm),theory(equality)],[582]),
    [iquote('0:Obv:582.3')] ).

cnf(584,plain,
    $false,
    inference(mrr,[status(thm)],[583,3,2,1,13,14,12]),
    [iquote('0:MRR:583.0,583.1,583.2,583.3,583.4,583.5,3.0,2.0,1.0,13.0,14.0,12.0')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : GEO331+1 : TPTP v8.1.0. Released v4.1.0.
% 0.03/0.13  % Command  : run_spass %d %s
% 0.13/0.34  % Computer : n019.cluster.edu
% 0.13/0.34  % Model    : x86_64 x86_64
% 0.13/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34  % Memory   : 8042.1875MB
% 0.13/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34  % CPULimit : 300
% 0.13/0.34  % WCLimit  : 600
% 0.13/0.34  % DateTime : Sat Jun 18 15:59:39 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 2.21/2.36  
% 2.21/2.36  SPASS V 3.9 
% 2.21/2.36  SPASS beiseite: Proof found.
% 2.21/2.36  % SZS status Theorem
% 2.21/2.36  Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p 
% 2.21/2.36  SPASS derived 58 clauses, backtracked 0 clauses, performed 0 splits and kept 264 clauses.
% 2.21/2.36  SPASS allocated 110853 KBytes.
% 2.21/2.36  SPASS spent	0:00:02.01 on the problem.
% 2.21/2.36  		0:00:00.04 for the input.
% 2.21/2.36  		0:00:01.79 for the FLOTTER CNF translation.
% 2.21/2.36  		0:00:00.00 for inferences.
% 2.21/2.36  		0:00:00.00 for the backtracking.
% 2.21/2.36  		0:00:00.12 for the reduction.
% 2.21/2.36  
% 2.21/2.36  
% 2.21/2.36  Here is a proof with depth 1, length 15 :
% 2.21/2.36  % SZS output start Refutation
% See solution above
% 2.21/2.36  Formulae used in the proof : qe_a40_s3_a40_plural_a40_383_a41__a41__a41_ qe_a40_s2_a40_plural_a40_383_a41__a41__a41_ qe_a40_s1_a40_plural_a40_383_a41__a41__a41_ pred_a40_383_a44__a32_9_a41_ pred_a40_383_a44__a32_8_a41_ pred_a40_383_a44__a32_7_a41_ holds_a40_384_a44__a32_1360_a44__a32_0_a41_ holds_a40_383_a44__a32_1356_a44__a32_0_a41_ ass_a40_cond_a40_proof_a40_385_a41__a44__a32_0_a41__a44__a32_2_a41_ ass_a40_cond_a40_proof_a40_385_a41__a44__a32_0_a41__a44__a32_0_a41_
% 2.21/2.36  
%------------------------------------------------------------------------------