TSTP Solution File: CSR032+2 by SPASS---3.9

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SPASS---3.9
% Problem  : CSR032+2 : TPTP v8.1.0. Released v3.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 : Fri Jul 15 23:24:23 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(270,axiom,
    individual(f_citynamedfn(s_agen,c_france)),
    file('CSR032+2.p',unknown),
    [] ).

cnf(456,axiom,
    ~ isa(f_citynamedfn(s_agen,c_france),u),
    file('CSR032+2.p',unknown),
    [] ).

cnf(911,axiom,
    ( ~ individual(u)
    | isa(u,c_individual) ),
    file('CSR032+2.p',unknown),
    [] ).

cnf(1159,plain,
    ~ individual(f_citynamedfn(s_agen,c_france)),
    inference(res,[status(thm),theory(equality)],[911,456]),
    [iquote('0:Res:911.1,456.0')] ).

cnf(1333,plain,
    $false,
    inference(mrr,[status(thm)],[1159,270]),
    [iquote('0:MRR:1159.0,270.0')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12  % Problem  : CSR032+2 : TPTP v8.1.0. Released v3.4.0.
% 0.11/0.13  % Command  : run_spass %d %s
% 0.13/0.34  % Computer : n005.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 11 11:39:09 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 0.71/0.90  
% 0.71/0.90  SPASS V 3.9 
% 0.71/0.90  SPASS beiseite: Proof found.
% 0.71/0.90  % SZS status Theorem
% 0.71/0.90  Problem: /export/starexec/sandbox/benchmark/theBenchmark.p 
% 0.71/0.90  SPASS derived 199 clauses, backtracked 0 clauses, performed 0 splits and kept 1118 clauses.
% 0.71/0.90  SPASS allocated 99824 KBytes.
% 0.71/0.90  SPASS spent	0:00:00.52 on the problem.
% 0.71/0.90  		0:00:00.05 for the input.
% 0.71/0.90  		0:00:00.19 for the FLOTTER CNF translation.
% 0.71/0.90  		0:00:00.00 for inferences.
% 0.71/0.90  		0:00:00.00 for the backtracking.
% 0.71/0.90  		0:00:00.14 for the reduction.
% 0.71/0.90  
% 0.71/0.90  
% 0.71/0.90  Here is a proof with depth 1, length 5 :
% 0.71/0.90  % SZS output start Refutation
% See solution above
% 0.71/0.90  Formulae used in the proof : ax1_318 query82 ax1_1014
% 0.71/0.90  
%------------------------------------------------------------------------------