TSTP Solution File: SYN312-1 by Leo-III---1.7.7

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Leo-III---1.7.7
% Problem  : SYN312-1 : TPTP v8.1.2. Bugfixed v2.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_Leo-III %s %d

% Computer : n023.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8042.1875MB
% OS       : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Fri May 19 12:28:19 EDT 2023

% Result   : Unsatisfiable 2.59s 1.53s
% Output   : Refutation 2.68s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    2
%            Number of leaves      :   15
% Syntax   : Number of formulae    :   24 (   7 unt;   7 typ;   0 def)
%            Number of atoms       :   29 (   0 equ;   0 cnn)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :  130 (  14   ~;  12   |;   0   &; 104   @)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   11 (   7 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :    5 (   5   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :    8 (   7 usr;   5 con; 0-3 aty)
%            Number of variables   :   32 (   0   ^;  32   !;   0   ?;  32   :)

% Comments : 
%------------------------------------------------------------------------------
thf(p_type,type,
    p: $i > $i > $i > $o ).

thf(f_type,type,
    f: $i > $i ).

thf(g_type,type,
    g: $i > $i ).

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

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

thf(c_type,type,
    c: $i ).

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

thf(1,negated_conjecture,
    ! [D: $i,C: $i,B: $i,A: $i] :
      ( ( p @ A @ B @ C )
      | ~ ( p @ A @ D @ C )
      | ~ ( p @ D @ B @ C ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause1) ).

thf(10,plain,
    ! [D: $i,C: $i,B: $i,A: $i] :
      ( ( p @ A @ B @ C )
      | ~ ( p @ A @ D @ C )
      | ~ ( p @ D @ B @ C ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[1]) ).

thf(3,negated_conjecture,
    ! [C: $i,B: $i,A: $i] :
      ( ( p @ A @ B @ C )
      | ~ ( p @ B @ A @ C ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause3) ).

thf(14,plain,
    ! [C: $i,B: $i,A: $i] :
      ( ( p @ A @ B @ C )
      | ~ ( p @ B @ A @ C ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[3]) ).

thf(5,negated_conjecture,
    ! [C: $i,B: $i,A: $i] :
      ( ( p @ ( g @ A ) @ B @ C )
      | ~ ( p @ A @ B @ C ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause5) ).

thf(9,plain,
    ! [C: $i,B: $i,A: $i] :
      ( ( p @ ( g @ A ) @ B @ C )
      | ~ ( p @ A @ B @ C ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[5]) ).

thf(7,negated_conjecture,
    p @ ( f @ b ) @ d @ c,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause7) ).

thf(13,plain,
    p @ ( f @ b ) @ d @ c,
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[7]) ).

thf(2,negated_conjecture,
    ! [C: $i,B: $i,A: $i] :
      ( ( p @ A @ B @ C )
      | ~ ( p @ C @ B @ A ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause2) ).

thf(12,plain,
    ! [C: $i,B: $i,A: $i] :
      ( ( p @ A @ B @ C )
      | ~ ( p @ C @ B @ A ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).

thf(4,negated_conjecture,
    ! [C: $i,B: $i,A: $i] :
      ( ( p @ A @ B @ ( f @ C ) )
      | ~ ( p @ A @ B @ C ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause4) ).

thf(16,plain,
    ! [C: $i,B: $i,A: $i] :
      ( ( p @ A @ B @ ( f @ C ) )
      | ~ ( p @ A @ B @ C ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[4]) ).

thf(6,negated_conjecture,
    p @ a @ ( f @ b ) @ c,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause6) ).

thf(11,plain,
    p @ a @ ( f @ b ) @ c,
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[6]) ).

thf(8,negated_conjecture,
    ~ ( p @ ( f @ ( g @ a ) ) @ ( f @ ( g @ d ) ) @ ( f @ ( g @ c ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause8) ).

thf(15,plain,
    ~ ( p @ ( f @ ( g @ a ) ) @ ( f @ ( g @ d ) ) @ ( f @ ( g @ c ) ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[8]) ).

thf(23,plain,
    $false,
    inference(e,[status(thm)],[10,14,9,13,12,16,11,15]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12  % Problem  : SYN312-1 : TPTP v8.1.2. Bugfixed v2.0.0.
% 0.11/0.15  % Command  : run_Leo-III %s %d
% 0.14/0.35  % Computer : n023.cluster.edu
% 0.14/0.35  % Model    : x86_64 x86_64
% 0.14/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35  % Memory   : 8042.1875MB
% 0.14/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35  % CPULimit : 300
% 0.14/0.35  % WCLimit  : 300
% 0.14/0.35  % DateTime : Thu May 18 19:42:30 EDT 2023
% 0.14/0.36  % CPUTime  : 
% 0.86/0.83  % [INFO] 	 Parsing problem /export/starexec/sandbox2/benchmark/theBenchmark.p ... 
% 1.21/0.94  % [INFO] 	 Parsing done (110ms). 
% 1.21/0.95  % [INFO] 	 Running in sequential loop mode. 
% 1.48/1.14  % [INFO] 	 eprover registered as external prover. 
% 1.48/1.14  % [INFO] 	 cvc4 registered as external prover. 
% 1.48/1.14  % [INFO] 	 Scanning for conjecture ... 
% 1.72/1.20  % [INFO] 	 Found a conjecture and 0 axioms. Running axiom selection ... 
% 1.78/1.23  % [INFO] 	 Axiom selection finished. Selected 0 axioms (removed 0 axioms). 
% 1.78/1.23  % [INFO] 	 Problem is propositional (TPTP CNF). 
% 1.78/1.23  % [INFO] 	 Type checking passed. 
% 1.88/1.24  % [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 ... 
% 2.59/1.52  % External prover 'e' found a proof!
% 2.59/1.52  % [INFO] 	 Killing All external provers ... 
% 2.59/1.52  % Time passed: 1013ms (effective reasoning time: 573ms)
% 2.59/1.52  % Solved by 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)>
% 2.59/1.53  % Axioms used in derivation (0): 
% 2.59/1.53  % No. of inferences in proof: 17
% 2.59/1.53  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p : 1013 ms resp. 573 ms w/o parsing
% 2.68/1.56  % SZS output start Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 2.68/1.56  % [INFO] 	 Killing All external provers ... 
%------------------------------------------------------------------------------