↑ 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  : ALG011-1 : TPTP v9.3.1. Released v2.7.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 : n012.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 06:45:53 AM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
thf(d_decl,type,
    d: $i > $o ).

thf(f_decl,type,
    f: $i > $i > $i ).

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

thf(a1_decl,type,
    a1: $i ).

thf(a2_decl,type,
    a2: $i ).

thf(4,axiom,
    ! [A: $i] :
      ( ( A @ d )
      | ( A @ c ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',partitions_union) ).

thf(14,plain,
    ! [A: $i] :
      ( ( A @ d )
      | ( A @ c ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[4]) ).

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

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

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

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

thf(6,axiom,
    a1 @ c,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',partition_c_not_empty) ).

thf(18,plain,
    a1 @ c,
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[6]) ).

thf(5,axiom,
    ! [A: $i] :
      ( ~ ( A @ d )
      | ~ ( A @ c ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',partitions_exclusive) ).

thf(16,plain,
    ! [A: $i] :
      ( ~ ( A @ d )
      | ~ ( A @ c ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[5]) ).

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

thf(8,plain,
    ! [B: $i,A: $i] :
      ( ~ ( B @ c )
      | ~ ( A @ c )
      | ( B @ ( A @ f ) @ d ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[1]) ).

thf(7,axiom,
    a2 @ d,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',partition_d_not_empty) ).

thf(19,plain,
    a2 @ d,
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[7]) ).

thf(20,plain,
    $false,
    inference(e,[status(thm)],[14,9,12,18,16,8,19]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01  % Problem  : ALG011-1 : TPTP v9.3.1. Released v2.7.0.
% 0.00/0.04  % 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.08/10.34  % Computer : n012.cluster.edu
% 0.08/10.34  % Model    : x86_64 x86_64
% 0.08/10.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/10.34  % Memory   : 8046.5625MB
% 0.08/10.34  % OS       : Linux 6.8.0-71-generic
% 0.08/10.34  % CPULimit : 300
% 0.08/10.34  % WCLimit  : 300
% 0.08/10.34  % DateTime : Sat Sep 26 20:58:19 UTC 2026
% 0.08/10.34  % CPUTime  : 
% 0.08/10.34  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.10/10.64  % [INFO] 	 Parsing problem /export/starexec/sandbox2/benchmark/theBenchmark.p ... 
% 0.10/10.74  % [INFO] 	 Parsing done (92ms). 
% 0.10/10.75  % [INFO] 	 Running in sequential loop mode. 
% 0.10/10.95  % [INFO] 	 eprover registered as external prover. 
% 0.10/10.96  % [INFO] 	 Scanning for conjecture ... 
% 0.10/11.00  % [INFO] 	 Found a conjecture (or negated_conjecture) and 5 axioms. Running axiom selection ... 
% 1.15/11.03  % [INFO] 	 Axiom selection finished. Selected 5 axioms (removed 0 axioms). 
% 1.15/11.03  % [INFO] 	 Problem is propositional (TPTP CNF). 
% 1.15/11.03  % [INFO] 	 Type checking passed. 
% 1.15/11.03  % [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 ... 
% 1.54/11.29  % External prover 'e' found a proof!
% 1.54/11.29  % [INFO] 	 Killing All external provers ... 
% 1.54/11.29  % Time passed: 867ms (effective reasoning time: 537ms)
% 1.54/11.29  % Axioms used in derivation (5): partition_c_not_empty, partitions_union, f_is_associative, partition_d_not_empty, partitions_exclusive
% 1.54/11.29  % No. of inferences in proof: 15
% 1.54/11.29  % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p : 867 ms resp. 537 ms w/o parsing
% 1.86/11.31  % SZS output start Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 1.86/11.31  % [INFO] 	 Killing All external provers ... 
%------------------------------------------------------------------------------