↑ 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  : SYN033-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 : n015.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:16:32 AM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
thf(p_decl,type,
    p: $i > $i > $i > $o ).

thf(k_decl,type,
    k: $i > $i ).

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

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

thf(1,negated_conjecture,
    ! [A: $i] :
      ~ ( A @ k @ ( A @ ( A @ k @ p ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_something) ).

thf(5,plain,
    ! [A: $i] :
      ~ ( A @ k @ ( A @ ( A @ k @ p ) ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[1]) ).

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

thf(7,plain,
    ! [B: $i,A: $i] : ( B @ ( A @ ( B @ ( A @ g ) @ p ) ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).

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

thf(8,plain,
    ! [B: $i,A: $i] : ( B @ ( B @ ( A @ h ) @ ( A @ p ) ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[3]) ).

thf(4,axiom,
    ! [F: $i,E: $i,D: $i,C: $i,B: $i,A: $i] :
      ( ( C @ ( E @ ( F @ p ) ) )
      | ~ ( F @ ( D @ ( A @ p ) ) )
      | ~ ( B @ ( E @ ( D @ p ) ) )
      | ~ ( C @ ( B @ ( A @ p ) ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause3) ).

thf(9,plain,
    ! [F: $i,E: $i,D: $i,C: $i,B: $i,A: $i] :
      ( ( C @ ( E @ ( F @ p ) ) )
      | ~ ( F @ ( D @ ( A @ p ) ) )
      | ~ ( B @ ( E @ ( D @ p ) ) )
      | ~ ( C @ ( B @ ( A @ p ) ) ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[4]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : SYN033-1 : TPTP v9.3.1. Released v1.0.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.12/0.40  % Computer : n015.cluster.edu
% 0.12/0.40  % Model    : x86_64 x86_64
% 0.12/0.40  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.40  % Memory   : 8046.5625MB
% 0.12/0.40  % OS       : Linux 6.8.0-71-generic
% 0.12/0.40  % CPULimit : 300
% 0.12/0.40  % WCLimit  : 300
% 0.12/0.40  % DateTime : Sat Sep 26 17:08:29 UTC 2026
% 0.12/0.40  % CPUTime  : 
% 0.12/0.40  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.83/0.99  % [INFO] 	 Parsing problem /export/starexec/sandbox/benchmark/theBenchmark.p ... 
% 1.19/1.16  % [INFO] 	 Parsing done (169ms). 
% 1.19/1.17  % [INFO] 	 Running in sequential loop mode. 
% 1.71/1.56  % [INFO] 	 eprover registered as external prover. 
% 1.71/1.57  % [INFO] 	 Scanning for conjecture ... 
% 1.90/1.65  % [INFO] 	 Found a conjecture (or negated_conjecture) and 3 axioms. Running axiom selection ... 
% 1.90/1.68  % [INFO] 	 Axiom selection finished. Selected 3 axioms (removed 0 axioms). 
% 1.90/1.69  % [INFO] 	 Problem is propositional (TPTP CNF). 
% 1.90/1.69  % [INFO] 	 Type checking passed. 
% 1.90/1.69  % [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.12/2.22  % External prover 'e' found a proof!
% 3.12/2.22  % [INFO] 	 Killing All external provers ... 
% 3.12/2.22  % Time passed: 1679ms (effective reasoning time: 1045ms)
% 3.12/2.23  % Axioms used in derivation (3): clause1, clause2, clause3
% 3.12/2.23  % No. of inferences in proof: 9
% 3.12/2.23  % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p : 1679 ms resp. 1045 ms w/o parsing
% 3.12/2.26  % SZS output start Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 3.12/2.26  % [INFO] 	 Killing All external provers ... 
%------------------------------------------------------------------------------