↑ 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  : SET838-1 : TPTP v9.3.1. Released v3.2.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 : 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 : Sun Sep 27 08:31:05 AM UTC 2026

% Result   : Unsatisfiable 4.78s 2.50s
% Output   : Refutation 4.78s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    2
%            Number of leaves      :    4
% Syntax   : Number of formulae    :    9 (   3 unt;   0 typ;   0 def)
%            Number of atoms       :   15 (  14 equ;   0 cnn)
%            Maximal formula atoms :    2 (   1 avg)
%            Number of connectives :   40 (   8   ~;   6   |;   0   &;  26   @)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    4 (   3 avg)
%            Number of types       :    1 (   0 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :    6 (   4 usr;   2 con; 0-2 aty)
%            Number of variables   :    6 (   0   ^;   6   !;   0   ?;   6   :)

% Comments : 
%------------------------------------------------------------------------------
thf(v_f_decl,type,
    v_f: $i > $i ).

thf(v_g_decl,type,
    v_g: $i > $i ).

thf(v_x_decl,type,
    v_x: $i ).

thf(v_xa_decl,type,
    v_xa: $i > $i ).

thf(1,negated_conjecture,
    ( ( v_x @ v_g @ v_f )
    = v_x ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_0) ).

thf(5,plain,
    ( ( v_x @ v_g @ v_f )
    = v_x ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[1]) ).

thf(2,negated_conjecture,
    ! [A: $i] :
      ( ( ( A @ v_g @ v_f )
       != A )
      | ( A = v_x ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_1) ).

thf(6,plain,
    ! [A: $i] :
      ( ( ( A @ v_g @ v_f )
       != A )
      | ( A = v_x ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).

thf(3,negated_conjecture,
    ! [A: $i] :
      ( ( ( A @ v_f @ v_g )
       != A )
      | ( ( A @ v_xa @ v_f @ v_g )
        = ( A @ v_xa ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_2) ).

thf(7,plain,
    ! [A: $i] :
      ( ( ( A @ v_f @ v_g )
       != A )
      | ( ( A @ v_xa @ v_f @ v_g )
        = ( A @ v_xa ) ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[3]) ).

thf(4,negated_conjecture,
    ! [A: $i] :
      ( ( ( A @ v_f @ v_g )
       != A )
      | ( ( A @ v_xa )
       != A ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_3) ).

thf(8,plain,
    ! [A: $i] :
      ( ( ( A @ v_f @ v_g )
       != A )
      | ( ( A @ v_xa )
       != A ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[4]) ).

thf(18,plain,
    $false,
    inference(e,[status(thm)],[5,6,7,8]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : SET838-1 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.07  % 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.10/0.37  % Computer : n018.cluster.edu
% 0.10/0.37  % Model    : x86_64 x86_64
% 0.10/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37  % Memory   : 8046.5625MB
% 0.10/0.37  % OS       : Linux 6.8.0-71-generic
% 0.10/0.37  % CPULimit : 300
% 0.10/0.37  % WCLimit  : 300
% 0.10/0.37  % DateTime : Sat Sep 26 08:22:21 UTC 2026
% 0.10/0.37  % CPUTime  : 
% 0.10/0.37  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.93/0.94  % [INFO] 	 Parsing problem /export/starexec/sandbox/benchmark/theBenchmark.p ... 
% 2.16/1.34  % [INFO] 	 Parsing done (395ms). 
% 2.16/1.35  % [INFO] 	 Running in sequential loop mode. 
% 2.86/1.72  % [INFO] 	 eprover registered as external prover. 
% 2.86/1.73  % [INFO] 	 Scanning for conjecture ... 
% 3.39/1.92  % [INFO] 	 Found a conjecture (or negated_conjecture) and 1357 axioms. Running axiom selection ... 
% 3.39/1.96  % [INFO] 	 Axiom selection finished. Selected 0 axioms (removed 1357 axioms). 
% 3.39/1.96  % [INFO] 	 Problem is propositional (TPTP CNF). 
% 3.39/1.97  % [INFO] 	 Type checking passed. 
% 3.39/1.97  % [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.56/2.49  % External prover 'e' found a proof!
% 4.56/2.49  % [INFO] 	 Killing All external provers ... 
% 4.56/2.50  % Time passed: 1988ms (effective reasoning time: 1140ms)
% 4.78/2.50  % Axioms used in derivation (0): 
% 4.78/2.50  % No. of inferences in proof: 9
% 4.78/2.50  % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p : 1988 ms resp. 1140 ms w/o parsing
% 4.78/2.53  % SZS output start Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 4.78/2.53  % [INFO] 	 Killing All external provers ... 
%------------------------------------------------------------------------------