TSTP Solution File: LCL435-2 by SnakeForV---1.0

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SnakeForV---1.0
% Problem  : LCL435-2 : TPTP v8.1.0. Released v3.2.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_uns --cores 0 -t %d %s

% Computer : n024.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 : Wed Aug 31 17:42:30 EDT 2022

% Result   : Unsatisfiable 0.20s 0.50s
% Output   : Refutation 0.20s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    8
% Syntax   : Number of formulae    :   18 (  14 unt;   0 def)
%            Number of atoms       :   22 (   5 equ)
%            Maximal formula atoms :    2 (   1 avg)
%            Number of connectives :   10 (   6   ~;   4   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   2 avg)
%            Maximal term depth    :    4 (   1 avg)
%            Number of predicates  :    3 (   1 usr;   1 prp; 0-3 aty)
%            Number of functors    :   13 (  13 usr;  10 con; 0-3 aty)
%            Number of variables   :   15 (  15   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f36,plain,
    $false,
    inference(subsumption_resolution,[],[f35,f9]) ).

fof(f9,plain,
    ~ c_in(sF2,sF3,sF4),
    inference(definition_folding,[],[f1,f8,f7,f6,f5,f4]) ).

fof(f4,plain,
    c_PropLog_Opl_Oop_A_N_62(v_q,v_pa,t_a) = sF0,
    introduced(function_definition,[]) ).

fof(f5,plain,
    c_PropLog_Opl_Oop_A_N_62(v_pa,sF0,t_a) = sF1,
    introduced(function_definition,[]) ).

fof(f6,plain,
    c_PropLog_Opl_Oop_A_N_62(v_p,sF1,t_a) = sF2,
    introduced(function_definition,[]) ).

fof(f7,plain,
    c_PropLog_Othms(v_H,t_a) = sF3,
    introduced(function_definition,[]) ).

fof(f8,plain,
    tc_PropLog_Opl(t_a) = sF4,
    introduced(function_definition,[]) ).

fof(f1,axiom,
    ~ c_in(c_PropLog_Opl_Oop_A_N_62(v_p,c_PropLog_Opl_Oop_A_N_62(v_pa,c_PropLog_Opl_Oop_A_N_62(v_q,v_pa,t_a),t_a),t_a),c_PropLog_Othms(v_H,t_a),tc_PropLog_Opl(t_a)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_0) ).

fof(f35,plain,
    c_in(sF2,sF3,sF4),
    inference(superposition,[],[f31,f7]) ).

fof(f31,plain,
    ! [X2] : c_in(sF2,c_PropLog_Othms(X2,t_a),sF4),
    inference(subsumption_resolution,[],[f30,f16]) ).

fof(f16,plain,
    ! [X0] : c_in(sF1,c_PropLog_Othms(X0,t_a),sF4),
    inference(forward_demodulation,[],[f15,f5]) ).

fof(f15,plain,
    ! [X0] : c_in(c_PropLog_Opl_Oop_A_N_62(v_pa,sF0,t_a),c_PropLog_Othms(X0,t_a),sF4),
    inference(forward_demodulation,[],[f10,f8]) ).

fof(f10,plain,
    ! [X0] : c_in(c_PropLog_Opl_Oop_A_N_62(v_pa,sF0,t_a),c_PropLog_Othms(X0,t_a),tc_PropLog_Opl(t_a)),
    inference(superposition,[],[f2,f4]) ).

fof(f2,axiom,
    ! [X2,X3,X0,X1] : c_in(c_PropLog_Opl_Oop_A_N_62(X0,c_PropLog_Opl_Oop_A_N_62(X1,X0,X2),X2),c_PropLog_Othms(X3,X2),tc_PropLog_Opl(X2)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_PropLog_Othms_OK_0) ).

fof(f30,plain,
    ! [X2] :
      ( c_in(sF2,c_PropLog_Othms(X2,t_a),sF4)
      | ~ c_in(sF1,c_PropLog_Othms(X2,t_a),sF4) ),
    inference(forward_demodulation,[],[f29,f8]) ).

fof(f29,plain,
    ! [X2] :
      ( c_in(sF2,c_PropLog_Othms(X2,t_a),sF4)
      | ~ c_in(sF1,c_PropLog_Othms(X2,t_a),tc_PropLog_Opl(t_a)) ),
    inference(forward_demodulation,[],[f22,f8]) ).

fof(f22,plain,
    ! [X2] :
      ( c_in(sF2,c_PropLog_Othms(X2,t_a),tc_PropLog_Opl(t_a))
      | ~ c_in(sF1,c_PropLog_Othms(X2,t_a),tc_PropLog_Opl(t_a)) ),
    inference(superposition,[],[f3,f6]) ).

fof(f3,axiom,
    ! [X2,X3,X0,X1] :
      ( c_in(c_PropLog_Opl_Oop_A_N_62(X0,X1,X2),c_PropLog_Othms(X3,X2),tc_PropLog_Opl(X2))
      | ~ c_in(X1,c_PropLog_Othms(X3,X2),tc_PropLog_Opl(X2)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_PropLog_Oweaken__right_0) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem    : LCL435-2 : TPTP v8.1.0. Released v3.2.0.
% 0.03/0.13  % Command    : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_uns --cores 0 -t %d %s
% 0.13/0.34  % Computer : n024.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    : 300
% 0.13/0.34  % DateTime   : Tue Aug 30 02:03:19 EDT 2022
% 0.13/0.35  % CPUTime    : 
% 0.20/0.49  % (18808)lrs+10_1:1_kws=precedence:lwlo=on:tgt=ground:i=99966:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/99966Mi)
% 0.20/0.50  % (18808)First to succeed.
% 0.20/0.50  % (18812)lrs+10_1:1_bd=off:drc=off:lcm=reverse:nwc=5.0:sd=1:sgt=16:spb=goal_then_units:ss=axioms:to=lpo:i=43:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/43Mi)
% 0.20/0.50  % (18808)Refutation found. Thanks to Tanya!
% 0.20/0.50  % SZS status Unsatisfiable for theBenchmark
% 0.20/0.50  % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.50  % (18808)------------------------------
% 0.20/0.50  % (18808)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.50  % (18808)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.50  % (18808)Termination reason: Refutation
% 0.20/0.50  
% 0.20/0.50  % (18808)Memory used [KB]: 5756
% 0.20/0.50  % (18808)Time elapsed: 0.094 s
% 0.20/0.50  % (18808)Instructions burned: 2 (million)
% 0.20/0.50  % (18808)------------------------------
% 0.20/0.50  % (18808)------------------------------
% 0.20/0.50  % (18804)Success in time 0.149 s
%------------------------------------------------------------------------------