↑ 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  : SYN132-1 : TPTP v9.3.1. Released v1.1.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 : n009.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:52 AM UTC 2026

% Result   : Unsatisfiable 20.07s 5.99s
% Output   : Refutation 20.07s
% 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 :   34 (   6   ~;   1   |;   0   &;  27   @)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    6 (   5 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :    6 (   3 usr;   4 con; 0-3 aty)
%            Number of variables   :    9 (   0   ^;   9   !;   0   ?;   9   :)

% Comments : 
%------------------------------------------------------------------------------
thf(m0_decl,type,
    m0: $i > $i > $i > $o ).

thf(e_decl,type,
    e: $i ).

thf(a_decl,type,
    a: $i ).

thf(342,axiom,
    ! [A: $i] : ( a @ ( A @ ( a @ m0 ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_12) ).

thf(1015,plain,
    ! [A: $i] : ( a @ ( A @ ( a @ m0 ) ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[342]) ).

thf(1,negated_conjecture,
    ! [A: $i] :
      ~ ( a @ ( e @ ( A @ m0 ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this) ).

thf(370,plain,
    ! [A: $i] :
      ~ ( a @ ( e @ ( A @ m0 ) ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[1]) ).

thf(371,plain,
    ! [A: $i] :
      ~ ( a @ ( e @ ( A @ m0 ) ) ),
    inference(polarity_switch,[status(thm)],[370]) ).

thf(1348,plain,
    ! [B: $i,A: $i] :
      ( ( ( a @ ( A @ ( a @ m0 ) ) )
       != ( a @ ( e @ ( B @ m0 ) ) ) )
      | ~ $true ),
    inference(paramod_ordered,[status(thm)],[1015,371]) ).

thf(1349,plain,
    ! [B: $i,A: $i] :
      ( ( a @ ( A @ ( a @ m0 ) ) )
     != ( a @ ( e @ ( B @ m0 ) ) ) ),
    inference(simp,[status(thm)],[1348]) ).

thf(1350,plain,
    $false,
    inference(pattern_uni,[status(thm)],[1349:[bind(A,$thf( e )),bind(B,$thf( a ))]]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : SYN132-1 : TPTP v9.3.1. Released v1.1.0.
% 0.00/0.07  % 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.14/0.40  % Computer : n009.cluster.edu
% 0.14/0.40  % Model    : x86_64 x86_64
% 0.14/0.40  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.40  % Memory   : 8046.5625MB
% 0.14/0.40  % OS       : Linux 6.8.0-71-generic
% 0.14/0.40  % CPULimit : 300
% 0.14/0.40  % WCLimit  : 300
% 0.14/0.40  % DateTime : Sat Sep 26 17:14:44 UTC 2026
% 0.14/0.40  % CPUTime  : 
% 0.14/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/1.01  % [INFO] 	 Parsing problem /export/starexec/sandbox2/benchmark/theBenchmark.p ... 
% 1.85/1.32  % [INFO] 	 Parsing done (313ms). 
% 1.85/1.34  % [INFO] 	 Running in sequential loop mode. 
% 2.91/1.75  % [INFO] 	 eprover registered as external prover. 
% 2.91/1.76  % [INFO] 	 Scanning for conjecture ... 
% 3.42/1.91  % [INFO] 	 Found a conjecture (or negated_conjecture) and 368 axioms. Running axiom selection ... 
% 3.83/2.07  % [INFO] 	 Axiom selection finished. Selected 368 axioms (removed 0 axioms). 
% 4.77/2.30  % [INFO] 	 Problem is propositional (TPTP CNF). 
% 4.77/2.32  % [INFO] 	 Type checking passed. 
% 4.77/2.32  % [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 ... 
% 20.07/5.98  % [INFO] 	 Killing All external provers ... 
% 20.07/5.99  % Time passed: 5425ms (effective reasoning time: 4636ms)
% 20.07/5.99  % Axioms used in derivation (1): axiom_12
% 20.07/5.99  % No. of inferences in proof: 8
% 20.07/5.99  % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p : 5425 ms resp. 4636 ms w/o parsing
% 20.07/6.01  % SZS output start Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 20.07/6.01  % [INFO] 	 Killing All external provers ... 
%------------------------------------------------------------------------------