TSTP Solution File: SYO487^6 by Leo-III---1.7.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Leo-III---1.7.12
% Problem : SYO487^6 : TPTP v8.2.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_Leo-III %s %d
% Computer : n002.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 : Tue May 21 08:57:08 EDT 2024
% Result : Theorem 3.21s 1.67s
% Output : Refutation 3.25s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 23
% Syntax : Number of formulae : 29 ( 10 unt; 11 typ; 8 def)
% Number of atoms : 58 ( 8 equ; 0 cnn)
% Maximal formula atoms : 8 ( 3 avg)
% Number of connectives : 79 ( 7 ~; 3 |; 2 &; 63 @)
% ( 0 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 3 avg)
% Number of types : 3 ( 1 usr)
% Number of type conns : 43 ( 43 >; 0 *; 0 +; 0 <<)
% Number of symbols : 16 ( 14 usr; 5 con; 0-3 aty)
% Number of variables : 29 ( 11 ^ 18 !; 0 ?; 29 :)
% Comments :
%------------------------------------------------------------------------------
thf(mu_type,type,
mu: $tType ).
thf(mimplies_type,type,
mimplies: ( $i > $o ) > ( $i > $o ) > $i > $o ).
thf(mimplies_def,definition,
( mimplies
= ( ^ [A: $i > $o] : ( mor @ ( mnot @ A ) ) ) ) ).
thf(mforall_ind_type,type,
mforall_ind: ( mu > $i > $o ) > $i > $o ).
thf(mforall_ind_def,definition,
( mforall_ind
= ( ^ [A: mu > $i > $o,B: $i] :
! [C: mu] : ( A @ C @ B ) ) ) ).
thf(mexists_ind_type,type,
mexists_ind: ( mu > $i > $o ) > $i > $o ).
thf(mexists_ind_def,definition,
( mexists_ind
= ( ^ [A: mu > $i > $o] :
( mnot
@ ( mforall_ind
@ ^ [B: mu] : ( mnot @ ( A @ B ) ) ) ) ) ) ).
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(mvalid_type,type,
mvalid: ( $i > $o ) > $o ).
thf(mvalid_def,definition,
( mvalid
= ( '!' @ $i ) ) ).
thf(rel_s5_type,type,
rel_s5: $i > $i > $o ).
thf(mdia_s5_type,type,
mdia_s5: ( $i > $o ) > $i > $o ).
thf(mdia_s5_def,definition,
( mdia_s5
= ( ^ [A: $i > $o] : ( mnot @ ( mbox_s5 @ ( mnot @ A ) ) ) ) ) ).
thf(f_type,type,
f: mu > $i > $o ).
thf(1,conjecture,
( mvalid
@ ( mimplies @ ( mdia_s5 @ ( mforall_ind @ f ) )
@ ( mexists_ind
@ ^ [A: mu] : ( mdia_s5 @ ( f @ A ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove) ).
thf(2,negated_conjecture,
~ ( mvalid
@ ( mimplies @ ( mdia_s5 @ ( mforall_ind @ f ) )
@ ( mexists_ind
@ ^ [A: mu] : ( mdia_s5 @ ( f @ A ) ) ) ) ),
inference(neg_conjecture,[status(cth)],[1]) ).
thf(6,plain,
~ ! [A: $i] :
( ! [B: $i] :
( ~ ( rel_s5 @ A @ B )
| ~ ! [C: mu] : ( f @ C @ B ) )
| ~ ! [B: mu,C: $i] :
( ~ ( rel_s5 @ A @ C )
| ~ ( f @ B @ C ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).
thf(3,axiom,
mreflexive @ rel_s5,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',a1) ).
thf(11,plain,
! [A: $i] : ( rel_s5 @ A @ A ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[3]) ).
thf(4,axiom,
mtransitive @ rel_s5,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',a2) ).
thf(13,plain,
! [A: $i,B: $i,C: $i] :
( ( ( rel_s5 @ A @ B )
& ( rel_s5 @ B @ C ) )
=> ( rel_s5 @ A @ C ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[4]) ).
thf(5,axiom,
msymmetric @ rel_s5,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',a3) ).
thf(15,plain,
! [A: $i,B: $i] :
( ( rel_s5 @ A @ B )
=> ( rel_s5 @ B @ A ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[5]) ).
thf(17,plain,
$false,
inference(e,[status(thm)],[6,11,13,15]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SYO487^6 : TPTP v8.2.0. Released v4.0.0.
% 0.07/0.15 % Command : run_Leo-III %s %d
% 0.14/0.36 % Computer : n002.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Mon May 20 09:05:09 EDT 2024
% 0.14/0.36 % CPUTime :
% 0.94/0.87 % [INFO] Parsing problem /export/starexec/sandbox/benchmark/theBenchmark.p ...
% 1.40/1.01 % [INFO] Parsing done (143ms).
% 1.40/1.02 % [INFO] Running in sequential loop mode.
% 1.79/1.22 % [INFO] eprover registered as external prover.
% 1.79/1.22 % [INFO] cvc4 registered as external prover.
% 1.79/1.22 % [INFO] Scanning for conjecture ...
% 2.09/1.32 % [INFO] Found a conjecture (or negated_conjecture) and 3 axioms. Running axiom selection ...
% 2.28/1.34 % [INFO] Axiom selection finished. Selected 3 axioms (removed 0 axioms).
% 2.28/1.34 % [INFO] Problem is higher-order (TPTP THF).
% 2.28/1.35 % [INFO] Type checking passed.
% 2.28/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.21/1.67 % External prover 'e' found a proof!
% 3.21/1.67 % [INFO] Killing All external provers ...
% 3.21/1.67 % Time passed: 1139ms (effective reasoning time: 645ms)
% 3.21/1.67 % 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.21/1.67 % Axioms used in derivation (3): a1, a2, a3
% 3.21/1.67 % No. of inferences in proof: 10
% 3.21/1.67 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p : 1139 ms resp. 645 ms w/o parsing
% 3.25/1.73 % SZS output start Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 3.25/1.73 % [INFO] Killing All external provers ...
%------------------------------------------------------------------------------