↑ 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  : SYN319-1 : TPTP v9.3.1. Released v1.2.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 : n005.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 09:17:11 AM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
thf(f_decl,type,
    f: $i > $o ).

thf(g_decl,type,
    g: $i > $o ).

thf(z1_decl,type,
    z1: $i > $i > $i ).

thf(y_decl,type,
    y: $i ).

thf(h_decl,type,
    h: $i > $o ).

thf(z2_decl,type,
    z2: $i > $i > $i ).

thf(6,negated_conjecture,
    ! [A: $i] :
      ( ( A @ h )
      | ~ ( A @ g ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause6) ).

thf(10,plain,
    ! [A: $i] :
      ( ( A @ h )
      | ~ ( A @ g ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[6]) ).

thf(4,negated_conjecture,
    ! [B: $i,A: $i] :
      ( ~ ( B @ ( A @ z1 ) @ f )
      | ~ ( y @ ( A @ z1 ) @ g ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause4) ).

thf(14,plain,
    ! [B: $i,A: $i] :
      ( ~ ( B @ ( A @ z1 ) @ f )
      | ~ ( y @ ( A @ z1 ) @ g ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[4]) ).

thf(1,negated_conjecture,
    ! [B: $i,A: $i] :
      ( ( B @ g )
      | ( A @ f ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause1) ).

thf(9,plain,
    ! [B: $i,A: $i] :
      ( ( B @ g )
      | ( A @ f ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[1]) ).

thf(3,negated_conjecture,
    ! [A: $i] :
      ( ( A @ g )
      | ~ ( y @ ( A @ z1 ) @ g ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause3) ).

thf(13,plain,
    ! [A: $i] :
      ( ( A @ g )
      | ~ ( y @ ( A @ z1 ) @ g ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[3]) ).

thf(7,negated_conjecture,
    ! [B: $i,A: $i] :
      ~ ( B @ ( A @ z2 ) @ h ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause7) ).

thf(12,plain,
    ! [B: $i,A: $i] :
      ~ ( B @ ( A @ z2 ) @ h ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[7]) ).

thf(2,negated_conjecture,
    ! [B: $i,A: $i] :
      ( ~ ( A @ ( B @ z1 ) @ f )
      | ( A @ f ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause2) ).

thf(11,plain,
    ! [B: $i,A: $i] :
      ( ~ ( A @ ( B @ z1 ) @ f )
      | ( A @ f ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).

thf(5,negated_conjecture,
    ! [A: $i] :
      ( ( A @ h )
      | ~ ( A @ f ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause5) ).

thf(8,plain,
    ! [A: $i] :
      ( ( A @ h )
      | ~ ( A @ f ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[5]) ).

thf(26,plain,
    $false,
    inference(e,[status(thm)],[10,14,9,13,12,11,8]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SYN319-1 : TPTP v9.3.1. Released v1.2.0.
% 0.00/0.08  % 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.13/0.41  % Computer : n005.cluster.edu
% 0.13/0.41  % Model    : x86_64 x86_64
% 0.13/0.41  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.41  % Memory   : 8046.5625MB
% 0.13/0.41  % OS       : Linux 6.8.0-71-generic
% 0.13/0.41  % CPULimit : 300
% 0.13/0.41  % WCLimit  : 300
% 0.13/0.41  % DateTime : Sat Sep 26 17:32:47 UTC 2026
% 0.13/0.41  % CPUTime  : 
% 0.13/0.41  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.87/0.98  % [INFO] 	 Parsing problem /export/starexec/sandbox2/benchmark/theBenchmark.p ... 
% 1.26/1.17  % [INFO] 	 Parsing done (184ms). 
% 1.26/1.18  % [INFO] 	 Running in sequential loop mode. 
% 1.80/1.58  % [INFO] 	 eprover registered as external prover. 
% 1.80/1.59  % [INFO] 	 Scanning for conjecture ... 
% 2.01/1.68  % [INFO] 	 Found a conjecture (or negated_conjecture) and 0 axioms. Running axiom selection ... 
% 2.19/1.74  % [INFO] 	 Axiom selection finished. Selected 0 axioms (removed 0 axioms). 
% 2.19/1.74  % [INFO] 	 Problem is propositional (TPTP CNF). 
% 2.19/1.75  % [INFO] 	 Type checking passed. 
% 2.19/1.75  % [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.60/2.32  % External prover 'e' found a proof!
% 3.60/2.32  % [INFO] 	 Killing All external provers ... 
% 3.60/2.33  % Time passed: 1773ms (effective reasoning time: 1138ms)
% 3.60/2.33  % Axioms used in derivation (0): 
% 3.60/2.33  % No. of inferences in proof: 15
% 3.60/2.33  % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p : 1773 ms resp. 1138 ms w/o parsing
% 3.60/2.36  % SZS output start Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 3.60/2.36  % [INFO] 	 Killing All external provers ... 
%------------------------------------------------------------------------------