TSTP Solution File: SYN062+1 by Leo-III---1.7.7
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Leo-III---1.7.7
% Problem : SYN062+1 : TPTP v8.1.2. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_Leo-III %s %d
% Computer : n018.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:27:08 EDT 2023
% Result : Theorem 2.67s 1.57s
% Output : Refutation 2.82s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 10
% Syntax : Number of formulae : 16 ( 1 unt; 6 typ; 0 def)
% Number of atoms : 28 ( 0 equ; 0 cnn)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 47 ( 2 ~; 2 |; 7 &; 27 @)
% ( 0 <=>; 9 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 5 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 6 ( 6 >; 0 *; 0 +; 0 <<)
% Number of symbols : 7 ( 6 usr; 1 con; 0-1 aty)
% Number of variables : 9 ( 0 ^; 9 !; 0 ?; 9 :)
% Comments :
%------------------------------------------------------------------------------
thf(big_f_type,type,
big_f: $i > $o ).
thf(big_k_type,type,
big_k: $i > $o ).
thf(big_j_type,type,
big_j: $i > $o ).
thf(big_g_type,type,
big_g: $i > $o ).
thf(big_h_type,type,
big_h: $i > $o ).
thf(big_i_type,type,
big_i: $i > $o ).
thf(1,conjecture,
! [A: $i] :
( ( ( big_f @ A )
& ( big_k @ A ) )
=> ( big_j @ A ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',pel32) ).
thf(2,negated_conjecture,
~ ! [A: $i] :
( ( ( big_f @ A )
& ( big_k @ A ) )
=> ( big_j @ A ) ),
inference(neg_conjecture,[status(cth)],[1]) ).
thf(6,plain,
~ ! [A: $i] :
( ( ( big_f @ A )
& ( big_k @ A ) )
=> ( big_j @ A ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).
thf(3,axiom,
! [A: $i] :
( ( ( big_f @ A )
& ( ( big_g @ A )
| ( big_h @ A ) ) )
=> ( big_i @ A ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',pel32_1) ).
thf(10,plain,
! [A: $i] :
( ( ( big_f @ A )
& ( ( big_g @ A )
| ( big_h @ A ) ) )
=> ( big_i @ A ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[3]) ).
thf(4,axiom,
! [A: $i] :
( ( ( big_i @ A )
& ( big_h @ A ) )
=> ( big_j @ A ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',pel32_2) ).
thf(13,plain,
! [A: $i] :
( ( ( big_i @ A )
& ( big_h @ A ) )
=> ( big_j @ A ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[4]) ).
thf(5,axiom,
! [A: $i] :
( ( big_k @ A )
=> ( big_h @ A ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',pel32_3) ).
thf(15,plain,
! [A: $i] :
( ( big_k @ A )
=> ( big_h @ A ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[5]) ).
thf(19,plain,
$false,
inference(e,[status(thm)],[6,10,13,15]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : SYN062+1 : TPTP v8.1.2. Released v2.0.0.
% 0.10/0.15 % Command : run_Leo-III %s %d
% 0.15/0.36 % Computer : n018.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 300
% 0.15/0.36 % DateTime : Thu May 18 19:42:14 EDT 2023
% 0.15/0.36 % CPUTime :
% 0.88/0.84 % [INFO] Parsing problem /export/starexec/sandbox/benchmark/theBenchmark.p ...
% 1.20/0.95 % [INFO] Parsing done (105ms).
% 1.20/0.95 % [INFO] Running in sequential loop mode.
% 1.51/1.15 % [INFO] eprover registered as external prover.
% 1.51/1.15 % [INFO] cvc4 registered as external prover.
% 1.51/1.16 % [INFO] Scanning for conjecture ...
% 1.76/1.20 % [INFO] Found a conjecture and 3 axioms. Running axiom selection ...
% 1.85/1.22 % [INFO] Axiom selection finished. Selected 3 axioms (removed 0 axioms).
% 1.87/1.23 % [INFO] Problem is first-order (TPTP FOF).
% 1.87/1.23 % [INFO] Type checking passed.
% 1.87/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.67/1.57 % External prover 'e' found a proof!
% 2.67/1.57 % [INFO] Killing All external provers ...
% 2.67/1.57 % Time passed: 1053ms (effective reasoning time: 613ms)
% 2.67/1.57 % 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.67/1.57 % Axioms used in derivation (3): pel32_1, pel32_2, pel32_3
% 2.67/1.57 % No. of inferences in proof: 10
% 2.67/1.57 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p : 1053 ms resp. 613 ms w/o parsing
% 2.82/1.64 % SZS output start Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 2.82/1.64 % [INFO] Killing All external provers ...
%------------------------------------------------------------------------------