↑ 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  : ROB004-1 : TPTP v9.3.1. Released v1.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : java -Xss128m -Xmx2g -Xms1g -jar /export/starexec/sandbox/solver/bin/leo3.jar /export/starexec/sandbox/benchmark/theBenchmark.p -t 300 -p  --atp eprover=/export/starexec/sandbox/solver/bin/externals/eprover --instantiate 39

% Computer : n011.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 3.69s 2.53s
% Output   : Refutation 3.69s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    2
%            Number of leaves      :    7
% Syntax   : Number of formulae    :   15 (  15 unt;   0 typ;   0 def)
%            Number of atoms       :   15 (  14 equ;   0 cnn)
%            Maximal formula atoms :    1 (   1 avg)
%            Number of connectives :   78 (   2   ~;   0   |;   0   &;  76   @)
%                                         (   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     :    8 (   6 usr;   5 con; 0-2 aty)
%            Number of variables   :   14 (   0   ^;  14   !;   0   ?;  14   :)

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

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

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

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

thf(d_decl,type,
    d: $i ).

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

thf(7,axiom,
    ( ( c @ ( c @ add ) )
    = c ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',c_plus_c_is_c) ).

thf(21,plain,
    ( ( c @ ( c @ add ) )
    = c ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[7]) ).

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

thf(13,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,
    ( ( d @ negate )
    = c ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',negate_d_is_c) ).

thf(17,plain,
    ( ( d @ negate )
    = c ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[5]) ).

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

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

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

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

thf(6,axiom,
    ( ( d @ ( c @ add ) )
    = d ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',c_plus_d_is_d) ).

thf(19,plain,
    ( ( d @ ( c @ add ) )
    = d ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[6]) ).

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

thf(15,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(51,plain,
    $false,
    inference(e,[status(thm)],[21,13,17,11,8,19,15]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : ROB004-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.08  % Command  : java -Xss128m -Xmx2g -Xms1g -jar /export/starexec/sandbox/solver/bin/leo3.jar /export/starexec/sandbox/benchmark/theBenchmark.p -t 300 -p  --atp eprover=/export/starexec/sandbox/solver/bin/externals/eprover --instantiate 39
% 0.14/0.60  % Computer : n011.cluster.edu
% 0.14/0.60  % Model    : x86_64 x86_64
% 0.14/0.60  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.60  % Memory   : 8046.5625MB
% 0.14/0.60  % OS       : Linux 6.8.0-71-generic
% 0.14/0.60  % CPULimit : 300
% 0.14/0.60  % WCLimit  : 300
% 0.14/0.60  % DateTime : Sat Sep 26 06:13:29 UTC 2026
% 0.14/0.61  % CPUTime  : 
% 0.14/0.61  Running java -Xss128m -Xmx2g -Xms1g -jar /export/starexec/sandbox/solver/bin/leo3.jar /export/starexec/sandbox/benchmark/theBenchmark.p -t 300 -p  --atp eprover=/export/starexec/sandbox/solver/bin/externals/eprover --instantiate 39
% 0.88/1.19  % [INFO] 	 Parsing problem /export/starexec/sandbox/benchmark/theBenchmark.p ... 
% 1.16/1.37  % [INFO] 	 Parsing done (171ms). 
% 1.16/1.38  % [INFO] 	 Running in sequential loop mode. 
% 1.86/1.77  % [INFO] 	 eprover registered as external prover. 
% 1.86/1.78  % [INFO] 	 Scanning for conjecture ... 
% 2.05/1.87  % [INFO] 	 Found a conjecture (or negated_conjecture) and 6 axioms. Running axiom selection ... 
% 2.19/1.90  % [INFO] 	 Axiom selection finished. Selected 6 axioms (removed 0 axioms). 
% 2.19/1.91  % [INFO] 	 Problem is propositional (TPTP CNF). 
% 2.19/1.92  % [INFO] 	 Type checking passed. 
% 2.19/1.92  % [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 ... 
% 3.69/2.53  % External prover 'e' found a proof!
% 3.69/2.53  % [INFO] 	 Killing All external provers ... 
% 3.69/2.53  % Time passed: 1779ms (effective reasoning time: 1142ms)
% 3.69/2.53  % Axioms used in derivation (6): c_plus_c_is_c, c_plus_d_is_d, negate_d_is_c, robbins_axiom, associativity_of_add, commutativity_of_add
% 3.69/2.53  % No. of inferences in proof: 15
% 3.69/2.53  % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p : 1779 ms resp. 1142 ms w/o parsing
% 3.69/2.57  % SZS output start Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 3.69/2.57  % [INFO] 	 Killing All external provers ... 
%------------------------------------------------------------------------------