TSTP Solution File: SYO460^1 by Leo-III-SAT---1.7.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Leo-III-SAT---1.7.12
% Problem : SYO460^1 : TPTP v8.2.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_Leo-III %s %d
% Computer : n020.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 09:00:26 EDT 2024
% Result : Theorem 3.26s 1.70s
% Output : Refutation 3.26s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 20
% Syntax : Number of formulae : 39 ( 11 unt; 14 typ; 5 def)
% Number of atoms : 89 ( 8 equ; 0 cnn)
% Maximal formula atoms : 13 ( 3 avg)
% Number of connectives : 125 ( 28 ~; 20 |; 0 &; 77 @)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 4 avg)
% Number of types : 3 ( 1 usr)
% Number of type conns : 31 ( 31 >; 0 *; 0 +; 0 <<)
% Number of symbols : 19 ( 16 usr; 9 con; 0-3 aty)
% Number of variables : 14 ( 7 ^ 7 !; 0 ?; 14 :)
% Comments :
%------------------------------------------------------------------------------
thf(mu_type,type,
mu: $tType ).
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(mand_type,type,
mand: ( $i > $o ) > ( $i > $o ) > $i > $o ).
thf(mand_def,definition,
( mand
= ( ^ [A: $i > $o,B: $i > $o] : ( mnot @ ( mor @ ( mnot @ A ) @ ( mnot @ B ) ) ) ) ) ).
thf(mimplies_type,type,
mimplies: ( $i > $o ) > ( $i > $o ) > $i > $o ).
thf(mimplies_def,definition,
( mimplies
= ( ^ [A: $i > $o] : ( mor @ ( mnot @ A ) ) ) ) ).
thf(mvalid_type,type,
mvalid: ( $i > $o ) > $o ).
thf(mvalid_def,definition,
( mvalid
= ( '!' @ $i ) ) ).
thf(rel_k_type,type,
rel_k: $i > $i > $o ).
thf(mdia_k_type,type,
mdia_k: ( $i > $o ) > $i > $o ).
thf(mdia_k_def,definition,
( mdia_k
= ( ^ [A: $i > $o] : ( mnot @ ( mbox_k @ ( mnot @ A ) ) ) ) ) ).
thf(p_type,type,
p: $i > $o ).
thf(q_type,type,
q: $i > $o ).
thf(r_type,type,
r: $i > $o ).
thf(sk1_type,type,
sk1: $i ).
thf(sk2_type,type,
sk2: $o ).
thf(sk3_type,type,
sk3: $i ).
thf(sk4_type,type,
sk4: $i ).
thf(1,conjecture,
mvalid @ ( mimplies @ ( mor @ ( mdia_k @ ( mand @ p @ q ) ) @ ( mdia_k @ ( mand @ p @ r ) ) ) @ ( mdia_k @ p ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove) ).
thf(2,negated_conjecture,
~ ( mvalid @ ( mimplies @ ( mor @ ( mdia_k @ ( mand @ p @ q ) ) @ ( mdia_k @ ( mand @ p @ r ) ) ) @ ( mdia_k @ p ) ) ),
inference(neg_conjecture,[status(cth)],[1]) ).
thf(3,plain,
~ ! [A: $i] :
( ~ ( ~ ! [B: $i] :
( ~ ( rel_k @ A @ B )
| ~ ( p @ B )
| ~ ( q @ B ) )
| ~ ! [B: $i] :
( ~ ( rel_k @ A @ B )
| ~ ( p @ B )
| ~ ( r @ B ) ) )
| ~ ! [B: $i] :
( ~ ( rel_k @ A @ B )
| ~ ( p @ B ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).
thf(5,plain,
( ~ sk2
| ( rel_k @ sk1 @ sk4 ) ),
inference(cnf,[status(esa)],[3]) ).
thf(9,plain,
( ( p @ sk3 )
| sk2 ),
inference(cnf,[status(esa)],[3]) ).
thf(7,plain,
( ( rel_k @ sk1 @ sk3 )
| sk2 ),
inference(cnf,[status(esa)],[3]) ).
thf(4,plain,
! [A: $i] :
( ~ ( rel_k @ sk1 @ A )
| ~ ( p @ A ) ),
inference(cnf,[status(esa)],[3]) ).
thf(16,plain,
! [A: $i] :
( sk2
| ~ ( p @ A )
| ( ( rel_k @ sk1 @ sk3 )
!= ( rel_k @ sk1 @ A ) ) ),
inference(paramod_ordered,[status(thm)],[7,4]) ).
thf(17,plain,
( sk2
| ~ ( p @ sk3 ) ),
inference(pattern_uni,[status(thm)],[16:[bind(A,$thf( sk3 ))]]) ).
thf(18,plain,
( sk2
| ( ( p @ sk3 )
!= ( p @ sk3 ) ) ),
inference(paramod_ordered,[status(thm)],[9,17]) ).
thf(19,plain,
sk2,
inference(pattern_uni,[status(thm)],[18:[]]) ).
thf(27,plain,
( ~ $true
| ( rel_k @ sk1 @ sk4 ) ),
inference(rewrite,[status(thm)],[5,19]) ).
thf(28,plain,
rel_k @ sk1 @ sk4,
inference(simp,[status(thm)],[27]) ).
thf(29,plain,
! [A: $i] :
( ~ ( p @ A )
| ( ( rel_k @ sk1 @ sk4 )
!= ( rel_k @ sk1 @ A ) ) ),
inference(paramod_ordered,[status(thm)],[28,4]) ).
thf(30,plain,
~ ( p @ sk4 ),
inference(pattern_uni,[status(thm)],[29:[bind(A,$thf( sk4 ))]]) ).
thf(8,plain,
( ~ sk2
| ( p @ sk4 ) ),
inference(cnf,[status(esa)],[3]) ).
thf(21,plain,
( ~ $true
| ( p @ sk4 ) ),
inference(rewrite,[status(thm)],[8,19]) ).
thf(22,plain,
p @ sk4,
inference(simp,[status(thm)],[21]) ).
thf(33,plain,
~ $true,
inference(rewrite,[status(thm)],[30,22]) ).
thf(34,plain,
$false,
inference(simp,[status(thm)],[33]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SYO460^1 : TPTP v8.2.0. Released v4.0.0.
% 0.14/0.15 % Command : run_Leo-III %s %d
% 0.15/0.36 % Computer : n020.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 : Mon May 20 09:40:54 EDT 2024
% 0.15/0.36 % CPUTime :
% 0.95/0.86 % [INFO] Parsing problem /export/starexec/sandbox/benchmark/theBenchmark.p ...
% 1.22/1.00 % [INFO] Parsing done (139ms).
% 1.22/1.00 % [INFO] Running in sequential loop mode.
% 1.83/1.20 % [INFO] nitpick registered as external prover.
% 1.83/1.21 % [INFO] Scanning for conjecture ...
% 2.19/1.31 % [INFO] Found a conjecture (or negated_conjecture) and 0 axioms. Running axiom selection ...
% 2.19/1.32 % [INFO] Axiom selection finished. Selected 0 axioms (removed 0 axioms).
% 2.19/1.33 % [INFO] Problem is higher-order (TPTP THF).
% 2.19/1.33 % [INFO] Type checking passed.
% 2.19/1.33 % [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.26/1.69 % [INFO] Killing All external provers ...
% 3.26/1.69 % Time passed: 1170ms (effective reasoning time: 684ms)
% 3.26/1.69 % 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.26/1.69 % Axioms used in derivation (0):
% 3.26/1.69 % No. of inferences in proof: 20
% 3.26/1.70 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p : 1170 ms resp. 684 ms w/o parsing
% 3.26/1.73 % SZS output start Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 3.26/1.73 % [INFO] Killing All external provers ...
%------------------------------------------------------------------------------