↑ Up

LEO-II---2.3.1.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : LEO-II---2.3.1
% Problem  : NUM671^1 : TPTP v9.3.1. Released v3.7.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : leo --cores 7 --timeout 300 --proofoutput 1 --foatp e --atp e=/export/starexec/sandbox2/solver/bin/eprover /export/starexec/sandbox2/benchmark/theBenchmark.p

% Computer : n018.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8046.5625MB
% OS       : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Wed Oct  7 10:34:52 AM UTC 2026

% Result   : Theorem 0.11s 0.19s
% Output   : CNFRefutation 0.11s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    2
% Syntax   : Number of formulae    :   11 (  11 unt;   0 typ;   0 def)
%            Number of atoms       :   27 (  17 equ;   0 cnn)
%            Maximal formula atoms :    1 (   2 avg)
%            Number of connectives :   26 (   2   ~;   0   |;   0   &;  24   @)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    1 (   1 avg)
%            Number of types       :    1 (   1 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :    7 (   4 usr;   5 con; 0-2 aty)
%            Number of variables   :    0 (   0   ^;   0   !;   0   ?;   0   :)

% Comments : 
%------------------------------------------------------------------------------
thf(tp_nat,type,
    nat: $tType ).

thf(tp_pl,type,
    pl: nat > nat > nat ).

thf(tp_x,type,
    x: nat ).

thf(tp_y,type,
    y: nat ).

thf(tp_z,type,
    z: nat ).

thf(1,axiom,
    x = y,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',i) ).

thf(2,conjecture,
    ( ( pl @ x @ z )
    = ( pl @ y @ z ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',satz19b) ).

thf(3,negated_conjecture,
    ( ( ( pl @ x @ z )
      = ( pl @ y @ z ) )
    = $false ),
    inference(negate_conjecture,[status(cth)],[2]) ).

thf(4,plain,
    ( ( ( pl @ x @ z )
      = ( pl @ y @ z ) )
    = $false ),
    inference(unfold_def,[status(thm)],[3]) ).

thf(5,plain,
    ( ( x = y )
    = $true ),
    inference(unfold_def,[status(thm)],[1]) ).

thf(6,plain,
    ( ( ( pl @ x @ z )
     != ( pl @ y @ z ) )
    = $true ),
    inference(polarity_switch,[status(thm)],[4]) ).

thf(7,plain,
    ( ( x = y )
    = $true ),
    inference(copy,[status(thm)],[5]) ).

thf(8,plain,
    ( ( ( pl @ x @ z )
     != ( pl @ y @ z ) )
    = $true ),
    inference(copy,[status(thm)],[6]) ).

thf(9,plain,
    ( ( ( pl @ x @ z )
      = ( pl @ y @ z ) )
    = $false ),
    inference(extcnf_not_pos,[status(thm)],[8]) ).

thf(10,plain,
    $false = $true,
    inference(fo_atp_e,[status(thm)],[7,9]) ).

thf(11,plain,
    $false,
    inference(solved_all_splits,[solved_all_splits(join,[])],[10]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : NUM671^1 : TPTP v9.3.1. Released v3.7.0.
% 0.00/0.04  % Command  : leo --cores 7 --timeout 300 --proofoutput 1 --foatp e --atp e=/export/starexec/sandbox2/solver/bin/eprover /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.11/0.15  % Computer : n018.cluster.edu
% 0.11/0.15  % Model    : x86_64 x86_64
% 0.11/0.15  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.15  % Memory   : 8046.5625MB
% 0.11/0.15  % OS       : Linux 6.8.0-71-generic
% 0.11/0.15  % CPULimit : 300
% 0.11/0.15  % WCLimit  : 300
% 0.11/0.15  % DateTime : Tue Oct  6 13:36:30 UTC 2026
% 0.11/0.16  % CPUTime  : 
% 0.11/0.16  Running leo --cores 7 --timeout 300 --proofoutput 1 --foatp e --atp e=/export/starexec/sandbox2/solver/bin/eprover /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.11/0.19  
% 0.11/0.19   No.of.Axioms: 1
% 0.11/0.19  
% 0.11/0.19   Length.of.Defs: 0
% 0.11/0.19  
% 0.11/0.19   Contains.Choice.Funs: false
% 0.11/0.19  
% 0.11/0.19  ********************************
% 0.11/0.19  *   All subproblems solved!    *
% 0.11/0.19  ********************************
% 0.11/0.19  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p : (rf:0,axioms:1,ps:3,u:6,ude:true,rLeibEQ:true,rAndEQ:true,use_choice:true,use_extuni:true,use_extcnf_combined:false,expand_extuni:false,foatp:e,atp_timeout:25,atp_calls_frequency:5,ordering:none,proof_output:1,protocol_output:false,clause_count:10,loop_count:0,foatp_calls:1,translation:fof_full)
% 0.11/0.19  
% 0.11/0.19  %**** Beginning of derivation protocol ****
% 0.11/0.19  % SZS output start CNFRefutation
% See solution above
% 0.11/0.19  
% 0.11/0.19  %**** End of derivation protocol ****
% 0.11/0.19  %**** no. of clauses in derivation: 11 ****
% 0.11/0.19  %**** clause counter: 10 ****
% 0.11/0.19  
% 0.11/0.19  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p : (rf:0,axioms:1,ps:3,u:6,ude:true,rLeibEQ:true,rAndEQ:true,use_choice:true,use_extuni:true,use_extcnf_combined:false,expand_extuni:false,foatp:e,atp_timeout:25,atp_calls_frequency:5,ordering:none,proof_output:1,protocol_output:false,clause_count:10,loop_count:0,foatp_calls:1,translation:fof_full)
%------------------------------------------------------------------------------