↑ 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  : GRP433-1 : TPTP v9.3.1. Released v2.6.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 : n019.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 07:20:59 AM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
thf(multiply_decl,type,
    multiply: $i > $i > $i ).

thf(inverse_decl,type,
    inverse: $i > $i ).

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

thf(b1_decl,type,
    b1: $i ).

thf(1,negated_conjecture,
    ( ( a1 @ ( a1 @ inverse @ multiply ) )
   != ( b1 @ ( b1 @ inverse @ multiply ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_these_axioms_1) ).

thf(3,plain,
    ( ( a1 @ ( a1 @ inverse @ multiply ) )
   != ( b1 @ ( b1 @ inverse @ multiply ) ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[1]) ).

thf(2,axiom,
    ! [D: $i,C: $i,B: $i,A: $i] :
      ( ( D @ inverse @ ( D @ multiply ) @ ( B @ ( A @ ( C @ ( B @ ( A @ multiply ) @ multiply ) @ inverse @ multiply ) @ multiply ) @ multiply ) @ inverse )
      = C ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',single_axiom) ).

thf(6,plain,
    ! [D: $i,C: $i,B: $i,A: $i] :
      ( ( D @ inverse @ ( D @ multiply ) @ ( B @ ( A @ ( C @ ( B @ ( A @ multiply ) @ multiply ) @ inverse @ multiply ) @ multiply ) @ multiply ) @ inverse )
      = C ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).

thf(21,plain,
    $false,
    inference(e,[status(thm)],[3,6]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04  % Problem  : GRP433-1 : TPTP v9.3.1. Released v2.6.0.
% 0.00/0.10  % 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.21/0.46  % Computer : n019.cluster.edu
% 0.21/0.46  % Model    : x86_64 x86_64
% 0.21/0.46  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.21/0.46  % Memory   : 8046.5625MB
% 0.21/0.46  % OS       : Linux 6.8.0-71-generic
% 0.21/0.46  % CPULimit : 300
% 0.21/0.46  % WCLimit  : 300
% 0.21/0.46  % DateTime : Fri Sep 25 14:54:03 UTC 2026
% 0.21/0.46  % CPUTime  : 
% 0.21/0.46  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
% 1.22/1.29  % [INFO] 	 Parsing problem /export/starexec/sandbox2/benchmark/theBenchmark.p ... 
% 1.69/1.53  % [INFO] 	 Parsing done (237ms). 
% 1.69/1.55  % [INFO] 	 Running in sequential loop mode. 
% 2.47/2.15  % [INFO] 	 eprover registered as external prover. 
% 2.66/2.16  % [INFO] 	 Scanning for conjecture ... 
% 2.73/2.27  % [INFO] 	 Found a conjecture (or negated_conjecture) and 1 axioms. Running axiom selection ... 
% 2.89/2.31  % [INFO] 	 Axiom selection finished. Selected 1 axioms (removed 0 axioms). 
% 2.89/2.32  % [INFO] 	 Problem is propositional (TPTP CNF). 
% 2.89/2.33  % [INFO] 	 Type checking passed. 
% 2.89/2.34  % [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 ... 
% 5.08/3.32  % External prover 'e' found a proof!
% 5.08/3.32  % [INFO] 	 Killing All external provers ... 
% 5.08/3.32  % Time passed: 2652ms (effective reasoning time: 1761ms)
% 5.08/3.32  % Axioms used in derivation (1): single_axiom
% 5.08/3.32  % No. of inferences in proof: 5
% 5.08/3.32  % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p : 2652 ms resp. 1761 ms w/o parsing
% 5.08/3.36  % SZS output start Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 5.08/3.36  % [INFO] 	 Killing All external provers ... 
%------------------------------------------------------------------------------