TSTP Solution File: SYO443^1 by Leo-III---1.7.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Leo-III---1.7.12
% Problem : SYO443^1 : 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:56:47 EDT 2024
% Result : Theorem 4.23s 2.67s
% Output : Refutation 4.52s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 24
% Syntax : Number of formulae : 30 ( 10 unt; 12 typ; 8 def)
% Number of atoms : 78 ( 8 equ; 0 cnn)
% Maximal formula atoms : 16 ( 4 avg)
% Number of connectives : 134 ( 21 ~; 17 |; 2 &; 90 @)
% ( 0 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 16 ( 4 avg)
% Number of types : 3 ( 1 usr)
% Number of type conns : 43 ( 43 >; 0 *; 0 +; 0 <<)
% Number of symbols : 16 ( 14 usr; 4 con; 0-3 aty)
% Number of variables : 34 ( 12 ^ 22 !; 0 ?; 34 :)
% Comments :
%------------------------------------------------------------------------------
thf(mu_type,type,
mu: $tType ).
thf(mnot_type,type,
mnot: ( $i > $o ) > $i > $o ).
thf(mnot_def,definition,
( mnot
= ( ^ [A: $i > $o,B: $i] :
~ ( A @ B ) ) ) ).
thf(mor_type,type,
mor: ( $i > $o ) > ( $i > $o ) > $i > $o ).
thf(mor_def,definition,
( mor
= ( ^ [A: $i > $o,B: $i > $o,C: $i] :
( ( A @ C )
| ( B @ C ) ) ) ) ).
thf(mequiv_type,type,
mequiv: ( $i > $o ) > ( $i > $o ) > $i > $o ).
thf(mequiv_def,definition,
( mequiv
= ( ^ [A: $i > $o,B: $i > $o] : ( mand @ ( mimplies @ A @ B ) @ ( mimplies @ B @ A ) ) ) ) ).
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(mbox_s5_type,type,
mbox_s5: ( $i > $o ) > $i > $o ).
thf(mbox_s5_def,definition,
( mbox_s5
= ( ^ [A: $i > $o,B: $i] :
! [C: $i] :
( ~ ( rel_s5 @ B @ C )
| ( A @ C ) ) ) ) ).
thf(p_type,type,
p: $i > $o ).
thf(q_type,type,
q: $i > $o ).
thf(1,conjecture,
mvalid @ ( mequiv @ ( mbox_s5 @ ( mor @ ( mnot @ p ) @ ( mbox_s5 @ q ) ) ) @ ( mor @ ( mbox_s5 @ ( mnot @ p ) ) @ ( mbox_s5 @ q ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove) ).
thf(2,negated_conjecture,
~ ( mvalid @ ( mequiv @ ( mbox_s5 @ ( mor @ ( mnot @ p ) @ ( mbox_s5 @ q ) ) ) @ ( mor @ ( mbox_s5 @ ( mnot @ p ) ) @ ( mbox_s5 @ q ) ) ) ),
inference(neg_conjecture,[status(cth)],[1]) ).
thf(6,plain,
~ ! [A: $i] :
~ ( ~ ( ~ ! [B: $i] :
( ~ ( rel_s5 @ A @ B )
| ~ ( p @ B )
| ! [C: $i] :
( ~ ( rel_s5 @ B @ C )
| ( q @ C ) ) )
| ! [B: $i] :
( ~ ( rel_s5 @ A @ B )
| ~ ( p @ B ) )
| ! [B: $i] :
( ~ ( rel_s5 @ A @ B )
| ( q @ B ) ) )
| ~ ( ~ ( ! [B: $i] :
( ~ ( rel_s5 @ A @ B )
| ~ ( p @ B ) )
| ! [B: $i] :
( ~ ( rel_s5 @ A @ B )
| ( q @ B ) ) )
| ! [B: $i] :
( ~ ( rel_s5 @ A @ B )
| ~ ( p @ B )
| ! [C: $i] :
( ~ ( rel_s5 @ B @ C )
| ( q @ 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(19,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(21,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(23,plain,
! [A: $i,B: $i] :
( ( rel_s5 @ A @ B )
=> ( rel_s5 @ B @ A ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[5]) ).
thf(25,plain,
$false,
inference(cvc4,[status(thm)],[6,19,21,23]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13 % Problem : SYO443^1 : TPTP v8.2.0. Released v4.0.0.
% 0.04/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:03:39 EDT 2024
% 0.14/0.37 % CPUTime :
% 1.15/1.09 % [INFO] Parsing problem /export/starexec/sandbox/benchmark/theBenchmark.p ...
% 1.85/1.37 % [INFO] Parsing done (276ms).
% 1.85/1.38 % [INFO] Running in sequential loop mode.
% 2.54/1.83 % [INFO] eprover registered as external prover.
% 2.54/1.83 % [INFO] cvc4 registered as external prover.
% 2.58/1.84 % [INFO] Scanning for conjecture ...
% 2.92/2.03 % [INFO] Found a conjecture (or negated_conjecture) and 3 axioms. Running axiom selection ...
% 3.12/2.07 % [INFO] Axiom selection finished. Selected 3 axioms (removed 0 axioms).
% 3.12/2.07 % [INFO] Problem is higher-order (TPTP THF).
% 3.12/2.07 % [INFO] Type checking passed.
% 3.17/2.08 % [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 ...
% 4.23/2.67 % External prover 'cvc4' found a proof!
% 4.23/2.67 % [INFO] Killing All external provers ...
% 4.23/2.67 % Time passed: 2133ms (effective reasoning time: 1278ms)
% 4.23/2.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)>
% 4.23/2.67 % Axioms used in derivation (3): a1, a2, a3
% 4.23/2.67 % No. of inferences in proof: 10
% 4.23/2.67 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p : 2133 ms resp. 1278 ms w/o parsing
% 4.52/2.73 % SZS output start Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 4.52/2.73 % [INFO] Killing All external provers ...
%------------------------------------------------------------------------------