↑ 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  : SYN291-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 : n008.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:17:08 AM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
thf(q1_decl,type,
    q1: $i > $i > $i > $o ).

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

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

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

thf(k0_decl,type,
    k0: $i > $o ).

thf(320,axiom,
    ( ~ ( d @ s0 )
    | ~ ( e @ k0 )
    | ( d @ ( d @ ( d @ q1 ) ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',rule_117) ).

thf(972,plain,
    ( ~ ( d @ s0 )
    | ~ ( e @ k0 )
    | ( d @ ( d @ ( d @ q1 ) ) ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[320]) ).

thf(973,plain,
    ( ~ ( d @ s0 )
    | ~ ( e @ k0 )
    | ( d @ ( d @ ( d @ q1 ) ) ) ),
    inference(cnf,[status(esa)],[972]) ).

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

thf(368,plain,
    ! [B: $i,A: $i] :
      ~ ( B @ ( A @ ( d @ q1 ) ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[1]) ).

thf(369,plain,
    ! [B: $i,A: $i] :
      ~ ( B @ ( A @ ( d @ q1 ) ) ),
    inference(polarity_switch,[status(thm)],[368]) ).

thf(111,axiom,
    e @ k0,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_28) ).

thf(578,plain,
    e @ k0,
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[111]) ).

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

thf(984,plain,
    d @ s0,
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[327]) ).

thf(14901,plain,
    ( ~ $true
    | ~ $true
    | $false ),
    inference(rewrite,[status(thm)],[973,369,578,984]) ).

thf(14902,plain,
    $false,
    inference(simp,[status(thm)],[14901]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : SYN291-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.13/0.81  % Computer : n008.cluster.edu
% 0.13/0.81  % Model    : x86_64 x86_64
% 0.13/0.81  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.81  % Memory   : 8046.5625MB
% 0.13/0.81  % OS       : Linux 6.8.0-71-generic
% 0.13/0.81  % CPULimit : 300
% 0.13/0.81  % WCLimit  : 300
% 0.13/0.81  % DateTime : Sat Sep 26 17:31:11 UTC 2026
% 0.13/0.81  % CPUTime  : 
% 0.13/0.81  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.73/1.15  % [INFO] 	 Parsing problem /export/starexec/sandbox/benchmark/theBenchmark.p ... 
% 1.64/1.40  % [INFO] 	 Parsing done (244ms). 
% 1.64/1.42  % [INFO] 	 Running in sequential loop mode. 
% 2.64/1.82  % [INFO] 	 eprover registered as external prover. 
% 2.64/1.83  % [INFO] 	 Scanning for conjecture ... 
% 2.86/1.97  % [INFO] 	 Found a conjecture (or negated_conjecture) and 368 axioms. Running axiom selection ... 
% 3.24/2.14  % [INFO] 	 Axiom selection finished. Selected 366 axioms (removed 2 axioms). 
% 4.15/2.34  % [INFO] 	 Problem is propositional (TPTP CNF). 
% 4.15/2.36  % [INFO] 	 Type checking passed. 
% 4.15/2.36  % [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 ... 
% 76.72/27.59  % [INFO] 	 Killing All external provers ... 
% 76.72/27.59  % Time passed: 26685ms (effective reasoning time: 26162ms)
% 76.72/27.59  % Axioms used in derivation (3): rule_117, axiom_28, axiom_1
% 76.72/27.59  % No. of inferences in proof: 12
% 76.72/27.60  % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p : 26685 ms resp. 26162 ms w/o parsing
% 77.05/27.61  % SZS output start Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 77.05/27.61  % [INFO] 	 Killing All external provers ... 
%------------------------------------------------------------------------------