↑ Up

Leo-III---1.8.0.UNS-Ref.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Leo-III---1.8.0
% Problem  : ROB008-1 : TPTP v9.3.1. Released v1.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : java -Xss128m -Xmx2g -Xms1g -jar /export/starexec/sandbox2/solver/bin/leo3.jar /export/starexec/sandbox2/benchmark/theBenchmark.p -t 300 -p  --atp eprover=/export/starexec/sandbox2/solver/bin/externals/eprover --instantiate 39

% Computer : n016.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 : Sun Sep 27 08:26:45 AM UTC 2026

% Result   : Unsatisfiable 4.21s 7.28s
% Output   : Refutation 4.62s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    2
%            Number of leaves      :    5
% Syntax   : Number of formulae    :   11 (  11 unt;   0 typ;   0 def)
%            Number of atoms       :   11 (  10 equ;   0 cnn)
%            Maximal formula atoms :    1 (   1 avg)
%            Number of connectives :   74 (   2   ~;   0   |;   0   &;  72   @)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    4 (   2 avg)
%            Number of types       :    1 (   0 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :    7 (   5 usr;   4 con; 0-2 aty)
%            Number of variables   :   14 (   0   ^;  14   !;   0   ?;  14   :)

% Comments : 
%------------------------------------------------------------------------------
thf(add_decl,type,
    add: $i > $i > $i ).

thf(a_decl,type,
    a: $i ).

thf(b_decl,type,
    b: $i ).

thf(negate_decl,type,
    negate: $i > $i ).

thf(c_decl,type,
    c: $i ).

thf(1,negated_conjecture,
    ( ( b @ ( a @ add ) )
   != a ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_result) ).

thf(6,plain,
    ( ( b @ ( a @ add ) )
   != a ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[1]) ).

thf(2,axiom,
    ! [B: $i,A: $i] :
      ( ( B @ ( A @ add ) )
      = ( A @ ( B @ add ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',commutativity_of_add) ).

thf(9,plain,
    ! [B: $i,A: $i] :
      ( ( B @ ( A @ add ) )
      = ( A @ ( B @ add ) ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).

thf(4,axiom,
    ! [B: $i,A: $i] :
      ( ( B @ negate @ ( A @ add ) @ negate @ ( B @ ( A @ add ) @ negate @ add ) @ negate )
      = A ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',robbins_axiom) ).

thf(13,plain,
    ! [B: $i,A: $i] :
      ( ( B @ negate @ ( A @ add ) @ negate @ ( B @ ( A @ add ) @ negate @ add ) @ negate )
      = A ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[4]) ).

thf(3,axiom,
    ! [C: $i,B: $i,A: $i] :
      ( ( C @ ( B @ ( A @ add ) @ add ) )
      = ( C @ ( B @ add ) @ ( A @ add ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',associativity_of_add) ).

thf(11,plain,
    ! [C: $i,B: $i,A: $i] :
      ( ( C @ ( B @ ( A @ add ) @ add ) )
      = ( C @ ( B @ add ) @ ( A @ add ) ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[3]) ).

thf(5,axiom,
    ( ( c @ ( b @ add ) @ negate @ ( a @ add ) @ negate )
    = ( c @ negate @ ( b @ add ) @ ( a @ add ) @ negate ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',condition) ).

thf(15,plain,
    ( ( c @ ( b @ add ) @ negate @ ( a @ add ) @ negate )
    = ( c @ negate @ ( b @ add ) @ ( a @ add ) @ negate ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[5]) ).

thf(25,plain,
    $false,
    inference(e,[status(thm)],[6,9,13,11,15]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05  % Problem  : ROB008-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.12  % Command  : java -Xss128m -Xmx2g -Xms1g -jar /export/starexec/sandbox2/solver/bin/leo3.jar /export/starexec/sandbox2/benchmark/theBenchmark.p -t 300 -p  --atp eprover=/export/starexec/sandbox2/solver/bin/externals/eprover --instantiate 39
% 0.23/5.50  % Computer : n016.cluster.edu
% 0.23/5.50  % Model    : x86_64 x86_64
% 0.23/5.50  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.23/5.50  % Memory   : 8046.5625MB
% 0.23/5.50  % OS       : Linux 6.8.0-71-generic
% 0.23/5.54  % CPULimit : 300
% 0.23/5.54  % WCLimit  : 300
% 0.23/5.54  % DateTime : Sat Sep 26 06:19:21 UTC 2026
% 0.23/5.54  % CPUTime  : 
% 0.23/5.54  Running java -Xss128m -Xmx2g -Xms1g -jar /export/starexec/sandbox2/solver/bin/leo3.jar /export/starexec/sandbox2/benchmark/theBenchmark.p -t 300 -p  --atp eprover=/export/starexec/sandbox2/solver/bin/externals/eprover --instantiate 39
% 0.29/6.04  % [INFO] 	 Parsing problem /export/starexec/sandbox2/benchmark/theBenchmark.p ... 
% 1.43/6.19  % [INFO] 	 Parsing done (153ms). 
% 1.55/6.21  % [INFO] 	 Running in sequential loop mode. 
% 2.23/6.54  % [INFO] 	 eprover registered as external prover. 
% 2.23/6.55  % [INFO] 	 Scanning for conjecture ... 
% 2.48/6.61  % [INFO] 	 Found a conjecture (or negated_conjecture) and 4 axioms. Running axiom selection ... 
% 2.48/6.64  % [INFO] 	 Axiom selection finished. Selected 4 axioms (removed 0 axioms). 
% 2.48/6.65  % [INFO] 	 Problem is propositional (TPTP CNF). 
% 2.48/6.66  % [INFO] 	 Type checking passed. 
% 2.48/6.66  % [CONFIG] 	 Using configuration: timeout(300) with strategy<name(default),share(1.0),primSubst(3),sos(false),unifierCount(4),uniDepth(8),boolExt(true),choice(true),renaming(true),funcspec(false), domConstr(0),specialInstances(39),restrictUniAttempts(true),termOrdering(CPO)>.  Searching for refutation ... 
% 4.21/7.27  % External prover 'e' found a proof!
% 4.21/7.28  % [INFO] 	 Killing All external provers ... 
% 4.21/7.28  % Time passed: 1592ms (effective reasoning time: 1064ms)
% 4.21/7.28  % Axioms used in derivation (4): commutativity_of_add, robbins_axiom, associativity_of_add, condition
% 4.21/7.28  % No. of inferences in proof: 11
% 4.21/7.28  % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p : 1592 ms resp. 1064 ms w/o parsing
% 4.62/7.32  % SZS output start Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 4.62/7.32  % [INFO] 	 Killing All external provers ... 
%------------------------------------------------------------------------------