↑ 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  : SWV043+1 : TPTP v9.3.1. Bugfixed v3.3.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 : n017.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:54:40 AM UTC 2026

% Result   : Theorem 0.61s 0.32s
% Output   : CNFRefutation 0.61s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :    2
% Syntax   : Number of formulae    :   14 (  13 unt;   0 typ;   0 def)
%            Number of atoms       :   39 (  11 equ;   0 cnn)
%            Maximal formula atoms :    2 (   2 avg)
%            Number of connectives :    5 (   2   ~;   0   |;   0   &;   0   @)
%                                         (   0 <=>;   3  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    2 (   1 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :   36 (  33 usr;  13 con; 0-4 aty)
%            Number of variables   :    0 (   0   ^;   0   !;   0   ?;   0   :)

% Comments : 
%------------------------------------------------------------------------------
thf(tp_a_select2,type,
    a_select2: $i > $i > $i ).

thf(tp_a_select3,type,
    a_select3: $i > $i > $i > $i ).

thf(tp_def,type,
    def: $i ).

thf(tp_dim,type,
    dim: $i > $i > $i ).

thf(tp_geq,type,
    geq: $i > $i > $o ).

thf(tp_gt,type,
    gt: $i > $i > $o ).

thf(tp_inv,type,
    inv: $i > $i ).

thf(tp_leq,type,
    leq: $i > $i > $o ).

thf(tp_lt,type,
    lt: $i > $i > $o ).

thf(tp_minus,type,
    minus: $i > $i > $i ).

thf(tp_n0,type,
    n0: $i ).

thf(tp_n1,type,
    n1: $i ).

thf(tp_n2,type,
    n2: $i ).

thf(tp_n3,type,
    n3: $i ).

thf(tp_n4,type,
    n4: $i ).

thf(tp_n5,type,
    n5: $i ).

thf(tp_plus,type,
    plus: $i > $i > $i ).

thf(tp_pred,type,
    pred: $i > $i ).

thf(tp_succ,type,
    succ: $i > $i ).

thf(tp_sum,type,
    sum: $i > $i > $i > $i ).

thf(tp_tptp_const_array1,type,
    tptp_const_array1: $i > $i > $i ).

thf(tp_tptp_const_array2,type,
    tptp_const_array2: $i > $i > $i > $i ).

thf(tp_tptp_float_0_0,type,
    tptp_float_0_0: $i ).

thf(tp_tptp_madd,type,
    tptp_madd: $i > $i > $i ).

thf(tp_tptp_minus_1,type,
    tptp_minus_1: $i ).

thf(tp_tptp_mmul,type,
    tptp_mmul: $i > $i > $i ).

thf(tp_tptp_msub,type,
    tptp_msub: $i > $i > $i ).

thf(tp_tptp_update2,type,
    tptp_update2: $i > $i > $i > $i ).

thf(tp_tptp_update3,type,
    tptp_update3: $i > $i > $i > $i > $i ).

thf(tp_trans,type,
    trans: $i > $i ).

thf(tp_true,type,
    true: $o ).

thf(tp_uniform_int_rnd,type,
    uniform_int_rnd: $i > $i > $i ).

thf(tp_use,type,
    use: $i ).

thf(34,axiom,
    true,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ttrue) ).

thf(85,conjecture,
    ( true
   => true ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cl5_nebula_norm_0001) ).

thf(86,negated_conjecture,
    ( ( true
     => true )
    = $false ),
    inference(negate_conjecture,[status(cth)],[85]) ).

thf(87,plain,
    ( ( true
     => true )
    = $false ),
    inference(unfold_def,[status(thm)],[86]) ).

thf(88,plain,
    true = $true,
    inference(unfold_def,[status(thm)],[34]) ).

thf(89,plain,
    true = $true,
    inference(standard_cnf,[status(thm)],[87]) ).

thf(90,plain,
    true = $false,
    inference(standard_cnf,[status(thm)],[87]) ).

thf(91,plain,
    ( ( ~ true ) = $true ),
    inference(polarity_switch,[status(thm)],[90]) ).

thf(92,plain,
    true = $true,
    inference(copy,[status(thm)],[88]) ).

thf(93,plain,
    true = $true,
    inference(copy,[status(thm)],[89]) ).

thf(94,plain,
    ( ( ~ true ) = $true ),
    inference(copy,[status(thm)],[91]) ).

thf(95,plain,
    true = $false,
    inference(extcnf_not_pos,[status(thm)],[94]) ).

thf(96,plain,
    $false = $true,
    inference(fo_atp_e,[status(thm)],[92,95,93]) ).

thf(97,plain,
    $false,
    inference(solved_all_splits,[solved_all_splits(join,[])],[96]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : SWV043+1 : TPTP v9.3.1. Bugfixed v3.3.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.10/0.16  % Computer : n017.cluster.edu
% 0.10/0.16  % Model    : x86_64 x86_64
% 0.10/0.16  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.16  % Memory   : 8046.5625MB
% 0.10/0.16  % OS       : Linux 6.8.0-71-generic
% 0.10/0.16  % CPULimit : 300
% 0.10/0.16  % WCLimit  : 300
% 0.10/0.16  % DateTime : Tue Oct  6 16:12:31 UTC 2026
% 0.10/0.17  % CPUTime  : 
% 0.10/0.17  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.61/0.32  
% 0.61/0.32   No.of.Axioms: 1
% 0.61/0.32  
% 0.61/0.32   Length.of.Defs: 0
% 0.61/0.32  
% 0.61/0.32   Contains.Choice.Funs: false
% 0.61/0.32  .
% 0.61/0.32  
% 0.61/0.32  ********************************
% 0.61/0.32  *   All subproblems solved!    *
% 0.61/0.32  ********************************
% 0.61/0.32  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p : (rf:1,axioms:2,ps:0,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:299,atp_calls_frequency:5,ordering:none,proof_output:1,protocol_output:false,clause_count:96,loop_count:0,foatp_calls:1,translation:fof_full)
% 0.61/0.32  
% 0.61/0.32  %**** Beginning of derivation protocol ****
% 0.61/0.32  % SZS output start CNFRefutation
% See solution above
% 0.61/0.32  
% 0.61/0.32  %**** End of derivation protocol ****
% 0.61/0.32  %**** no. of clauses in derivation: 14 ****
% 0.61/0.32  %**** clause counter: 96 ****
% 0.61/0.32  
% 0.61/0.32  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p : (rf:1,axioms:2,ps:0,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:299,atp_calls_frequency:5,ordering:none,proof_output:1,protocol_output:false,clause_count:96,loop_count:0,foatp_calls:1,translation:fof_full)
%------------------------------------------------------------------------------