TSTP Solution File: ALG369-1 by SPASS---3.9

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SPASS---3.9
% Problem  : ALG369-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 : Thu Jul 14 18:03:30 EDT 2022

% Result   : Unsatisfiable 0.40s 0.56s
% Output   : Refutation 0.40s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    3
%            Number of leaves      :    5
% Syntax   : Number of clauses     :    8 (   5 unt;   0 nHn;   8 RR)
%            Number of literals    :   14 (   0 equ;   9 neg)
%            Maximal clause size   :    4 (   1 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    3 (   2 usr;   2 prp; 0-3 aty)
%            Number of functors    :    8 (   8 usr;   4 con; 0-3 aty)
%            Number of variables   :    0 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(515,axiom,
    ( ~ c_HOL_Oord__class_Oless(u,c_HOL_Oinverse__class_Odivide(v_e,v_m____,tc_RealDef_Oreal),tc_RealDef_Oreal)
    | ~ c_HOL_Oord__class_Oless(u,c_HOL_Oone__class_Oone(tc_RealDef_Oreal),tc_RealDef_Oreal)
    | ~ c_HOL_Oord__class_Oless(c_HOL_Ozero__class_Ozero(tc_RealDef_Oreal),u,tc_RealDef_Oreal)
    | v_thesis____ ),
    file('ALG369-1.p',unknown),
    [] ).

cnf(566,axiom,
    c_HOL_Oord__class_Oless(v_sko__CHAINED__1(v_e,v_m____),c_HOL_Oinverse__class_Odivide(v_e,v_m____,tc_RealDef_Oreal),tc_RealDef_Oreal),
    file('ALG369-1.p',unknown),
    [] ).

cnf(567,axiom,
    c_HOL_Oord__class_Oless(v_sko__CHAINED__1(v_e,v_m____),c_HOL_Oone__class_Oone(tc_RealDef_Oreal),tc_RealDef_Oreal),
    file('ALG369-1.p',unknown),
    [] ).

cnf(568,axiom,
    c_HOL_Oord__class_Oless(c_HOL_Ozero__class_Ozero(tc_RealDef_Oreal),v_sko__CHAINED__1(v_e,v_m____),tc_RealDef_Oreal),
    file('ALG369-1.p',unknown),
    [] ).

cnf(626,axiom,
    ~ v_thesis____,
    file('ALG369-1.p',unknown),
    [] ).

cnf(639,plain,
    ( ~ c_HOL_Oord__class_Oless(u,c_HOL_Oone__class_Oone(tc_RealDef_Oreal),tc_RealDef_Oreal)
    | ~ c_HOL_Oord__class_Oless(u,c_HOL_Oinverse__class_Odivide(v_e,v_m____,tc_RealDef_Oreal),tc_RealDef_Oreal)
    | ~ c_HOL_Oord__class_Oless(c_HOL_Ozero__class_Ozero(tc_RealDef_Oreal),u,tc_RealDef_Oreal) ),
    inference(mrr,[status(thm)],[515,626]),
    [iquote('0:MRR:515.3,626.0')] ).

cnf(649,plain,
    ( ~ c_HOL_Oord__class_Oless(v_sko__CHAINED__1(v_e,v_m____),c_HOL_Oone__class_Oone(tc_RealDef_Oreal),tc_RealDef_Oreal)
    | ~ c_HOL_Oord__class_Oless(c_HOL_Ozero__class_Ozero(tc_RealDef_Oreal),v_sko__CHAINED__1(v_e,v_m____),tc_RealDef_Oreal) ),
    inference(res,[status(thm),theory(equality)],[566,639]),
    [iquote('0:Res:566.0,639.0')] ).

cnf(658,plain,
    $false,
    inference(mrr,[status(thm)],[649,567,568]),
    [iquote('0:MRR:649.0,649.1,567.0,568.0')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : ALG369-1 : TPTP v8.1.0. Released v4.1.0.
% 0.03/0.13  % Command  : run_spass %d %s
% 0.12/0.33  % Computer : n019.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 : Wed Jun  8 15:54:40 EDT 2022
% 0.12/0.34  % CPUTime  : 
% 0.40/0.56  
% 0.40/0.56  SPASS V 3.9 
% 0.40/0.56  SPASS beiseite: Proof found.
% 0.40/0.56  % SZS status Theorem
% 0.40/0.56  Problem: /export/starexec/sandbox/benchmark/theBenchmark.p 
% 0.40/0.56  SPASS derived 12 clauses, backtracked 0 clauses, performed 0 splits and kept 548 clauses.
% 0.40/0.56  SPASS allocated 76616 KBytes.
% 0.40/0.56  SPASS spent	0:00:00.21 on the problem.
% 0.40/0.56  		0:00:00.06 for the input.
% 0.40/0.56  		0:00:00.00 for the FLOTTER CNF translation.
% 0.40/0.56  		0:00:00.00 for inferences.
% 0.40/0.56  		0:00:00.00 for the backtracking.
% 0.40/0.56  		0:00:00.09 for the reduction.
% 0.40/0.56  
% 0.40/0.56  
% 0.40/0.56  Here is a proof with depth 1, length 8 :
% 0.40/0.56  % SZS output start Refutation
% See solution above
% 0.40/0.56  Formulae used in the proof : cls_that_0 cls_CHAINED_2 cls_CHAINED_1 cls_CHAINED_0 cls_conjecture_0
% 0.40/0.56  
%------------------------------------------------------------------------------