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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SPASS---3.9
% Problem  : PUZ038-1 : TPTP v8.1.0. Released v2.4.0.
% Transfm  : none
% Format   : tptp
% Command  : run_spass %d %s

% Computer : n029.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 : Mon Jul 18 18:27:22 EDT 2022

% Result   : Unsatisfiable 0.49s 0.70s
% Output   : Refutation 0.49s
% 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;   2 neg)
%            Maximal clause size   :    2 (   1 avg)
%            Maximal term depth    :    6 (   2 avg)
%            Number of predicates  :    2 (   1 usr;   1 prp; 0-12 aty)
%            Number of functors    :   26 (  26 usr;  13 con; 0-2 aty)
%            Number of variables   :    0 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(1,axiom,
    state(bb(o,s(o)),v1(o,o),v2(o,s(s(s(o)))),v3(s(s(o)),o),v4(s(s(o)),s(s(s(o)))),h(s(s(o)),s(o)),s1(s(s(s(o))),s(o)),s2(s(s(s(o))),s(s(o))),s3(s(s(s(s(o)))),s(o)),s4(s(s(s(s(o)))),s(s(o))),e1(s(s(s(s(o)))),o),e2(s(s(s(s(o)))),s(s(s(o))))),
    file('PUZ038-1.p',unknown),
    [] ).

cnf(2,axiom,
    ~ state(u,v,w,v3(s(s(s(o))),o),x,y,z,x1,x2,x3,x4,x5),
    file('PUZ038-1.p',unknown),
    [] ).

cnf(29,axiom,
    ( ~ state(u,v,w,v3(x,y),z,x1,x2,x3,x4,x5,e1(s(s(x)),y),x6)
    | state(u,v,w,v3(s(x),y),z,x1,x2,x3,x4,x5,e1(x,y),x6) ),
    file('PUZ038-1.p',unknown),
    [] ).

cnf(1127,plain,
    state(bb(o,s(o)),v1(o,o),v2(o,s(s(s(o)))),v3(s(s(s(o))),o),v4(s(s(o)),s(s(s(o)))),h(s(s(o)),s(o)),s1(s(s(s(o))),s(o)),s2(s(s(s(o))),s(s(o))),s3(s(s(s(s(o)))),s(o)),s4(s(s(s(s(o)))),s(s(o))),e1(s(s(o)),o),e2(s(s(s(s(o)))),s(s(s(o))))),
    inference(res,[status(thm),theory(equality)],[1,29]),
    [iquote('0:Res:1.0,29.0')] ).

cnf(1128,plain,
    $false,
    inference(mrr,[status(thm)],[1127,2]),
    [iquote('0:MRR:1127.0,2.0')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : PUZ038-1 : TPTP v8.1.0. Released v2.4.0.
% 0.03/0.12  % Command  : run_spass %d %s
% 0.12/0.33  % Computer : n029.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 : Sun May 29 00:18:43 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.49/0.70  
% 0.49/0.70  SPASS V 3.9 
% 0.49/0.70  SPASS beiseite: Proof found.
% 0.49/0.70  % SZS status Theorem
% 0.49/0.70  Problem: /export/starexec/sandbox/benchmark/theBenchmark.p 
% 0.49/0.70  SPASS derived 1081 clauses, backtracked 0 clauses, performed 0 splits and kept 853 clauses.
% 0.49/0.70  SPASS allocated 64949 KBytes.
% 0.49/0.70  SPASS spent	0:00:00.34 on the problem.
% 0.49/0.70  		0:00:00.04 for the input.
% 0.49/0.70  		0:00:00.00 for the FLOTTER CNF translation.
% 0.49/0.70  		0:00:00.03 for inferences.
% 0.49/0.70  		0:00:00.00 for the backtracking.
% 0.49/0.70  		0:00:00.24 for the reduction.
% 0.49/0.70  
% 0.49/0.70  
% 0.49/0.70  Here is a proof with depth 1, length 5 :
% 0.49/0.70  % SZS output start Refutation
% See solution above
% 0.49/0.70  Formulae used in the proof : initial_state goal_state v3_down
% 0.49/0.70  
%------------------------------------------------------------------------------