↑ 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  : SYN134-1 : TPTP v9.3.1. Released v1.1.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 : n001.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 135.92s 74.57s
% Output   : Refutation 136.12s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   13
%            Number of leaves      :    5
% Syntax   : Number of formulae    :   24 (  11 unt;   0 typ;   0 def)
%            Number of atoms       :   57 (   6 equ;   0 cnn)
%            Maximal formula atoms :    4 (   2 avg)
%            Number of connectives :  113 (  24   ~;  21   |;   0   &;  68   @)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    9 (   5 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :   10 (   7 usr;   5 con; 0-2 aty)
%            Number of variables   :   28 (   0   ^;  28   !;   0   ?;  28   :)

% Comments : 
%------------------------------------------------------------------------------
thf(m2_decl,type,
    m2: $i > $o ).

thf(d_decl,type,
    d: $i ).

thf(n0_decl,type,
    n0: $i > $i > $o ).

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

thf(b_decl,type,
    b: $i ).

thf(s0_decl,type,
    s0: $i > $o ).

thf(l1_decl,type,
    l1: $i > $i > $o ).

thf(340,axiom,
    d @ s0,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_1) ).

thf(1011,plain,
    d @ s0,
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[340]) ).

thf(111,axiom,
    b @ ( a @ n0 ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_15) ).

thf(579,plain,
    b @ ( a @ n0 ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[111]) ).

thf(50,axiom,
    ! [B: $i,A: $i] :
      ( ~ ( A @ ( B @ n0 ) )
      | ( A @ ( A @ l1 ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',rule_002) ).

thf(461,plain,
    ! [B: $i,A: $i] :
      ( ~ ( A @ ( B @ n0 ) )
      | ( A @ ( A @ l1 ) ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[50]) ).

thf(462,plain,
    ! [B: $i,A: $i] :
      ( ~ ( A @ ( B @ n0 ) )
      | ( A @ ( A @ l1 ) ) ),
    inference(cnf,[status(esa)],[461]) ).

thf(5435,plain,
    ! [B: $i,A: $i] :
      ( ( ( b @ ( a @ n0 ) )
       != ( A @ ( B @ n0 ) ) )
      | ~ $true
      | ( A @ ( A @ l1 ) ) ),
    inference(paramod_ordered,[status(thm)],[579,462]) ).

thf(5436,plain,
    ! [B: $i,A: $i] :
      ( ( ( b @ ( a @ n0 ) )
       != ( A @ ( B @ n0 ) ) )
      | ( A @ ( A @ l1 ) ) ),
    inference(simp,[status(thm)],[5435]) ).

thf(5437,plain,
    b @ ( b @ l1 ),
    inference(pattern_uni,[status(thm)],[5436:[bind(A,$thf( b )),bind(B,$thf( a ))]]) ).

thf(324,axiom,
    ! [C: $i,B: $i,A: $i] :
      ( ~ ( C @ ( B @ l1 ) )
      | ~ ( A @ s0 )
      | ( A @ m2 ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',rule_135) ).

thf(983,plain,
    ! [C: $i,B: $i,A: $i] :
      ( ~ ( C @ ( B @ l1 ) )
      | ~ ( A @ s0 )
      | ( A @ m2 ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[324]) ).

thf(984,plain,
    ! [C: $i,B: $i,A: $i] :
      ( ~ ( C @ ( B @ l1 ) )
      | ~ ( A @ s0 )
      | ( A @ m2 ) ),
    inference(cnf,[status(esa)],[983]) ).

thf(43704,plain,
    ! [C: $i,B: $i,A: $i] :
      ( ( ( b @ ( b @ l1 ) )
       != ( C @ ( B @ l1 ) ) )
      | ~ $true
      | ~ ( A @ s0 )
      | ( A @ m2 ) ),
    inference(paramod_ordered,[status(thm)],[5437,984]) ).

thf(43705,plain,
    ! [C: $i,B: $i,A: $i] :
      ( ( ( b @ ( b @ l1 ) )
       != ( C @ ( B @ l1 ) ) )
      | ~ ( A @ s0 )
      | ( A @ m2 ) ),
    inference(simp,[status(thm)],[43704]) ).

thf(43706,plain,
    ! [A: $i] :
      ( ~ ( A @ s0 )
      | ( A @ m2 ) ),
    inference(pattern_uni,[status(thm)],[43705:[bind(A,$thf( A )),bind(B,$thf( b )),bind(C,$thf( b ))]]) ).

thf(43826,plain,
    ! [A: $i] :
      ( ( ( d @ s0 )
       != ( A @ s0 ) )
      | ~ $true
      | ( A @ m2 ) ),
    inference(paramod_ordered,[status(thm)],[1011,43706]) ).

thf(43827,plain,
    ! [A: $i] :
      ( ( ( d @ s0 )
       != ( A @ s0 ) )
      | ( A @ m2 ) ),
    inference(simp,[status(thm)],[43826]) ).

thf(43828,plain,
    d @ m2,
    inference(pattern_uni,[status(thm)],[43827:[bind(A,$thf( d ))]]) ).

thf(1,negated_conjecture,
    ~ ( d @ m2 ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this) ).

thf(368,plain,
    ~ ( d @ m2 ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[1]) ).

thf(369,plain,
    ~ ( d @ m2 ),
    inference(polarity_switch,[status(thm)],[368]) ).

thf(43832,plain,
    $false,
    inference(rewrite,[status(thm)],[43828,369]) ).

thf(43833,plain,
    $false,
    inference(simp,[status(thm)],[43832]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SYN134-1 : TPTP v9.3.1. Released v1.1.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.06/5.40  % Computer : n001.cluster.edu
% 0.06/5.40  % Model    : x86_64 x86_64
% 0.06/5.40  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.06/5.40  % Memory   : 8046.5625MB
% 0.06/5.40  % OS       : Linux 6.8.0-71-generic
% 0.06/5.40  % CPULimit : 300
% 0.06/5.40  % WCLimit  : 300
% 0.06/5.40  % DateTime : Sat Sep 26 17:20:05 UTC 2026
% 0.06/5.40  % CPUTime  : 
% 0.06/5.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.16/5.99  % [INFO] 	 Parsing problem /export/starexec/sandbox/benchmark/theBenchmark.p ... 
% 1.95/6.31  % [INFO] 	 Parsing done (321ms). 
% 1.95/6.32  % [INFO] 	 Running in sequential loop mode. 
% 2.68/6.71  % [INFO] 	 eprover registered as external prover. 
% 2.68/6.72  % [INFO] 	 Scanning for conjecture ... 
% 2.87/6.86  % [INFO] 	 Found a conjecture (or negated_conjecture) and 368 axioms. Running axiom selection ... 
% 3.09/7.01  % [INFO] 	 Axiom selection finished. Selected 366 axioms (removed 2 axioms). 
% 4.05/7.20  % [INFO] 	 Problem is propositional (TPTP CNF). 
% 4.05/7.21  % [INFO] 	 Type checking passed. 
% 4.05/7.22  % [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 ... 
% 135.92/74.57  % [INFO] 	 Killing All external provers ... 
% 135.92/74.57  % Time passed: 69026ms (effective reasoning time: 68238ms)
% 135.92/74.57  % Axioms used in derivation (4): axiom_1, axiom_15, rule_002, rule_135
% 135.92/74.57  % No. of inferences in proof: 24
% 135.92/74.57  % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p : 69026 ms resp. 68238 ms w/o parsing
% 136.12/74.60  % SZS output start Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 136.12/74.60  % [INFO] 	 Killing All external provers ... 
%------------------------------------------------------------------------------