TSTP Solution File: LCL862^1 by Leo-III---1.7.15
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Leo-III---1.7.15
% Problem : LCL862^1 : TPTP v8.2.0. Bugfixed v5.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_Leo-III %s %d THM
% Computer : n021.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 : Mon Jun 24 11:16:35 EDT 2024
% Result : Theorem 3.57s 1.83s
% Output : Refutation 3.61s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 5
% Syntax : Number of formulae : 8 ( 8 unt; 0 typ; 4 def)
% Number of atoms : 22 ( 7 equ; 0 cnn)
% Maximal formula atoms : 1 ( 2 avg)
% Number of connectives : 69 ( 2 ~; 0 |; 13 &; 48 @)
% ( 0 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 3 ( 2 avg)
% Number of types : 3 ( 1 usr)
% Number of type conns : 14 ( 14 >; 0 *; 0 +; 0 <<)
% Number of symbols : 6 ( 4 usr; 1 con; 0-2 aty)
% Number of variables : 26 ( 4 ^ 22 !; 0 ?; 26 :)
% Comments :
%------------------------------------------------------------------------------
thf(mu_type,type,
mu: $tType ).
thf(mreflexive_type,type,
mreflexive: ( $i > $i > $o ) > $o ).
thf(mreflexive_def,definition,
( mreflexive
= ( ^ [A: $i > $i > $o] :
! [B: $i] : ( A @ B @ B ) ) ) ).
thf(msymmetric_type,type,
msymmetric: ( $i > $i > $o ) > $o ).
thf(msymmetric_def,definition,
( msymmetric
= ( ^ [A: $i > $i > $o] :
! [B: $i,C: $i] :
( ( A @ B @ C )
=> ( A @ C @ B ) ) ) ) ).
thf(mtransitive_type,type,
mtransitive: ( $i > $i > $o ) > $o ).
thf(mtransitive_def,definition,
( mtransitive
= ( ^ [A: $i > $i > $o] :
! [B: $i,C: $i,D: $i] :
( ( ( A @ B @ C )
& ( A @ C @ D ) )
=> ( A @ B @ D ) ) ) ) ).
thf(meuclidean_type,type,
meuclidean: ( $i > $i > $o ) > $o ).
thf(meuclidean_def,definition,
( meuclidean
= ( ^ [A: $i > $i > $o] :
! [B: $i,C: $i,D: $i] :
( ( ( A @ B @ C )
& ( A @ B @ D ) )
=> ( A @ C @ D ) ) ) ) ).
thf(1,conjecture,
! [A: $i > $i > $o] :
( ( ( mreflexive @ A )
& ( meuclidean @ A ) )
= ( ( mreflexive @ A )
& ( mtransitive @ A )
& ( msymmetric @ A ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conj) ).
thf(2,negated_conjecture,
~ ! [A: $i > $i > $o] :
( ( ( mreflexive @ A )
& ( meuclidean @ A ) )
= ( ( mreflexive @ A )
& ( mtransitive @ A )
& ( msymmetric @ A ) ) ),
inference(neg_conjecture,[status(cth)],[1]) ).
thf(3,plain,
~ ! [A: $i > $i > $o] :
( ( ! [B: $i] : ( A @ B @ B )
& ! [B: $i,C: $i,D: $i] :
( ( ( A @ B @ C )
& ( A @ B @ D ) )
=> ( A @ C @ D ) ) )
= ( ! [B: $i] : ( A @ B @ B )
& ! [B: $i,C: $i,D: $i] :
( ( ( A @ B @ C )
& ( A @ C @ D ) )
=> ( A @ B @ D ) )
& ! [B: $i,C: $i] :
( ( A @ B @ C )
=> ( A @ C @ B ) ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).
thf(40,plain,
$false,
inference(e,[status(thm)],[3]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : LCL862^1 : TPTP v8.2.0. Bugfixed v5.0.0.
% 0.07/0.13 % Command : run_Leo-III %s %d THM
% 0.13/0.34 % Computer : n021.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Sat Jun 22 15:02:10 EDT 2024
% 0.13/0.34 % CPUTime :
% 0.97/0.88 % [INFO] Parsing problem /export/starexec/sandbox2/benchmark/theBenchmark.p ...
% 1.38/1.02 % [INFO] Parsing done (139ms).
% 1.38/1.03 % [INFO] Running in sequential loop mode.
% 1.85/1.23 % [INFO] eprover registered as external prover.
% 1.85/1.24 % [INFO] Scanning for conjecture ...
% 1.98/1.33 % [INFO] Found a conjecture (or negated_conjecture) and 0 axioms. Running axiom selection ...
% 2.26/1.35 % [INFO] Axiom selection finished. Selected 0 axioms (removed 0 axioms).
% 2.26/1.35 % [INFO] Problem is higher-order (TPTP THF).
% 2.26/1.35 % [INFO] Type checking passed.
% 2.26/1.35 % [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 ...
% 3.57/1.83 % External prover 'e' found a proof!
% 3.57/1.83 % [INFO] Killing All external provers ...
% 3.57/1.83 % Time passed: 1280ms (effective reasoning time: 794ms)
% 3.57/1.83 % 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)>
% 3.57/1.83 % Axioms used in derivation (0):
% 3.57/1.83 % No. of inferences in proof: 4
% 3.57/1.83 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p : 1280 ms resp. 794 ms w/o parsing
% 3.61/1.86 % SZS output start Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 3.61/1.86 % [INFO] Killing All external provers ...
%------------------------------------------------------------------------------