TSTP Solution File: SYN083+1 by iProver---3.9

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : iProver---3.9
% Problem  : SYN083+1 : TPTP v8.1.2. Released v2.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_iprover %s %d THM

% Computer : n002.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  : 300s
% DateTime : Fri May  3 03:29:13 EDT 2024

% Result   : Theorem 1.31s 1.24s
% Output   : CNFRefutation 1.31s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    3
% Syntax   : Number of formulae    :   12 (  11 unt;   0 def)
%            Number of atoms       :   13 (  12 equ)
%            Maximal formula atoms :    2 (   1 avg)
%            Number of connectives :    9 (   8   ~;   0   |;   0   &)
%                                         (   0 <=>;   1  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   4 avg)
%            Maximal term depth    :    4 (   2 avg)
%            Number of predicates  :    2 (   0 usr;   1 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   4 con; 0-2 aty)
%            Number of variables   :   25 (   0 sgn  14   !;   8   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f1,axiom,
    ! [X0,X1,X2] : f(X0,f(X1,X2)) = f(f(X0,X1),X2),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p61_1) ).

fof(f2,conjecture,
    ! [X0,X1,X2,X3] : f(X0,f(X1,f(X2,X3))) = f(f(f(X0,X1),X2),X3),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',pel61) ).

fof(f3,negated_conjecture,
    ~ ! [X0,X1,X2,X3] : f(X0,f(X1,f(X2,X3))) = f(f(f(X0,X1),X2),X3),
    inference(negated_conjecture,[],[f2]) ).

fof(f4,plain,
    ? [X0,X1,X2,X3] : f(X0,f(X1,f(X2,X3))) != f(f(f(X0,X1),X2),X3),
    inference(ennf_transformation,[],[f3]) ).

fof(f5,plain,
    ( ? [X0,X1,X2,X3] : f(X0,f(X1,f(X2,X3))) != f(f(f(X0,X1),X2),X3)
   => f(sK0,f(sK1,f(sK2,sK3))) != f(f(f(sK0,sK1),sK2),sK3) ),
    introduced(choice_axiom,[]) ).

fof(f6,plain,
    f(sK0,f(sK1,f(sK2,sK3))) != f(f(f(sK0,sK1),sK2),sK3),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3])],[f4,f5]) ).

fof(f7,plain,
    ! [X2,X0,X1] : f(X0,f(X1,X2)) = f(f(X0,X1),X2),
    inference(cnf_transformation,[],[f1]) ).

fof(f8,plain,
    f(sK0,f(sK1,f(sK2,sK3))) != f(f(f(sK0,sK1),sK2),sK3),
    inference(cnf_transformation,[],[f6]) ).

cnf(c_49,plain,
    f(f(X0,X1),X2) = f(X0,f(X1,X2)),
    inference(cnf_transformation,[],[f7]) ).

cnf(c_50,negated_conjecture,
    f(f(f(sK0,sK1),sK2),sK3) != f(sK0,f(sK1,f(sK2,sK3))),
    inference(cnf_transformation,[],[f8]) ).

cnf(c_56,plain,
    f(sK0,f(sK1,f(sK2,sK3))) != f(sK0,f(sK1,f(sK2,sK3))),
    inference(demodulation,[status(thm)],[c_50,c_49]) ).

cnf(c_57,plain,
    $false,
    inference(equality_resolution_simp,[status(thm)],[c_56]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13  % Problem  : SYN083+1 : TPTP v8.1.2. Released v2.0.0.
% 0.12/0.14  % Command  : run_iprover %s %d THM
% 0.13/0.35  % Computer : n002.cluster.edu
% 0.13/0.35  % Model    : x86_64 x86_64
% 0.13/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35  % Memory   : 8042.1875MB
% 0.13/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35  % CPULimit : 300
% 0.13/0.35  % WCLimit  : 300
% 0.13/0.35  % DateTime : Thu May  2 21:22:42 EDT 2024
% 0.13/0.35  % CPUTime  : 
% 0.20/0.50  Running first-order theorem proving
% 0.20/0.50  Running: /export/starexec/sandbox2/solver/bin/run_problem --schedule fof_schedule --heuristic_context casc_unsat --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 1.31/1.24  % SZS status Started for theBenchmark.p
% 1.31/1.24  % SZS status Theorem for theBenchmark.p
% 1.31/1.24  
% 1.31/1.24  %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 1.31/1.24  
% 1.31/1.24  ------  iProver source info
% 1.31/1.24  
% 1.31/1.24  git: date: 2024-05-02 19:28:25 +0000
% 1.31/1.24  git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 1.31/1.24  git: non_committed_changes: false
% 1.31/1.24  
% 1.31/1.24  ------ Parsing...
% 1.31/1.24  ------ Clausification by vclausify_rel  & Parsing by iProver...
% 1.31/1.24  
% 1.31/1.24  ------ Preprocessing...
% 1.31/1.24  
% 1.31/1.24  % SZS status Theorem for theBenchmark.p
% 1.31/1.24  
% 1.31/1.24  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.31/1.24  
% 1.31/1.24  
%------------------------------------------------------------------------------