↑ 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  : ANA042-2 : 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 : n003.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:50:22 AM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
thf(c_lessequals_decl,type,
    c_lessequals: $i > $i > $i > $o ).

thf(c_HOL_Oabs_decl,type,
    c_HOL_Oabs: $i > $i > $i ).

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

thf(t_c_decl,type,
    t_c: $i ).

thf(c_times_decl,type,
    c_times: $i > $i > $i > $i ).

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

thf(v_h_decl,type,
    v_h: $i > $i > $i ).

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

thf(v_xb_decl,type,
    v_xb: $i > $i ).

thf(1,negated_conjecture,
    ! [B: $i,A: $i] : ( t_c @ ( t_c @ ( B @ ( A @ v_h ) @ ( v_x @ c_times ) ) @ ( t_c @ ( B @ ( A @ v_f ) @ c_HOL_Oabs ) @ c_lessequals ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_1) ).

thf(3,plain,
    ! [B: $i,A: $i] : ( t_c @ ( t_c @ ( B @ ( A @ v_h ) @ ( v_x @ c_times ) ) @ ( t_c @ ( B @ ( A @ v_f ) @ c_HOL_Oabs ) @ c_lessequals ) ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[1]) ).

thf(2,negated_conjecture,
    ! [A: $i] :
      ~ ( t_c @ ( t_c @ ( A @ v_xb @ ( A @ v_xa @ v_h ) @ ( A @ c_times ) ) @ ( t_c @ ( A @ v_xb @ ( A @ v_xa @ v_f ) @ c_HOL_Oabs ) @ c_lessequals ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_3) ).

thf(4,plain,
    ! [A: $i] :
      ~ ( t_c @ ( t_c @ ( A @ v_xb @ ( A @ v_xa @ v_h ) @ ( A @ c_times ) ) @ ( t_c @ ( A @ v_xb @ ( A @ v_xa @ v_f ) @ c_HOL_Oabs ) @ c_lessequals ) ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).

thf(5,plain,
    ! [A: $i] :
      ~ ( t_c @ ( t_c @ ( A @ v_xb @ ( A @ v_xa @ v_h ) @ ( A @ c_times ) ) @ ( t_c @ ( A @ v_xb @ ( A @ v_xa @ v_f ) @ c_HOL_Oabs ) @ c_lessequals ) ) ),
    inference(polarity_switch,[status(thm)],[4]) ).

thf(6,plain,
    ! [C: $i,B: $i,A: $i] :
      ( ( ( t_c @ ( t_c @ ( B @ ( A @ v_h ) @ ( v_x @ c_times ) ) @ ( t_c @ ( B @ ( A @ v_f ) @ c_HOL_Oabs ) @ c_lessequals ) ) )
       != ( t_c @ ( t_c @ ( C @ v_xb @ ( C @ v_xa @ v_h ) @ ( C @ c_times ) ) @ ( t_c @ ( C @ v_xb @ ( C @ v_xa @ v_f ) @ c_HOL_Oabs ) @ c_lessequals ) ) ) )
      | ~ $true ),
    inference(paramod_ordered,[status(thm)],[3,5]) ).

thf(7,plain,
    ! [C: $i,B: $i,A: $i] :
      ( ( t_c @ ( t_c @ ( B @ ( A @ v_h ) @ ( v_x @ c_times ) ) @ ( t_c @ ( B @ ( A @ v_f ) @ c_HOL_Oabs ) @ c_lessequals ) ) )
     != ( t_c @ ( t_c @ ( C @ v_xb @ ( C @ v_xa @ v_h ) @ ( C @ c_times ) ) @ ( t_c @ ( C @ v_xb @ ( C @ v_xa @ v_f ) @ c_HOL_Oabs ) @ c_lessequals ) ) ) ),
    inference(simp,[status(thm)],[6]) ).

thf(8,plain,
    $false,
    inference(pattern_uni,[status(thm)],[7:[bind(A,$thf( v_x @ v_xa )),bind(B,$thf( v_x @ v_xb )),bind(C,$thf( v_x ))]]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04  % Problem  : ANA042-2 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.13  % 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.24/0.49  % Computer : n003.cluster.edu
% 0.24/0.49  % Model    : x86_64 x86_64
% 0.24/0.49  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.24/0.49  % Memory   : 8046.5625MB
% 0.24/0.49  % OS       : Linux 6.8.0-71-generic
% 0.24/0.49  % CPULimit : 300
% 0.24/0.49  % WCLimit  : 300
% 0.24/0.49  % DateTime : Sat Sep 26 22:11:25 UTC 2026
% 0.24/0.50  % CPUTime  : 
% 0.24/0.50  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
% 1.27/1.29  % [INFO] 	 Parsing problem /export/starexec/sandbox/benchmark/theBenchmark.p ... 
% 1.78/1.54  % [INFO] 	 Parsing done (250ms). 
% 1.78/1.56  % [INFO] 	 Running in sequential loop mode. 
% 2.85/2.18  % [INFO] 	 eprover registered as external prover. 
% 2.85/2.19  % [INFO] 	 Scanning for conjecture ... 
% 3.09/2.34  % [INFO] 	 Found a conjecture (or negated_conjecture) and 0 axioms. Running axiom selection ... 
% 3.24/2.41  % [INFO] 	 Axiom selection finished. Selected 0 axioms (removed 0 axioms). 
% 3.24/2.41  % [INFO] 	 Problem is propositional (TPTP CNF). 
% 3.24/2.41  % [INFO] 	 Type checking passed. 
% 3.24/2.42  % [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.18  % [INFO] 	 Killing All external provers ... 
% 5.08/3.18  % Time passed: 2481ms (effective reasoning time: 1611ms)
% 5.08/3.19  % Axioms used in derivation (0): 
% 5.08/3.19  % No. of inferences in proof: 8
% 5.08/3.19  % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p : 2481 ms resp. 1611 ms w/o parsing
% 5.11/3.25  % SZS output start Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 5.11/3.25  % [INFO] 	 Killing All external provers ... 
%------------------------------------------------------------------------------