TSTP Solution File: SYO429^1 by Leo-III-SAT---1.7.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Leo-III-SAT---1.7.12
% Problem : SYO429^1 : TPTP v8.2.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_Leo-III %s %d
% Computer : n004.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:13 EDT 2024
% Result : Theorem 3.74s 2.15s
% Output : Refutation 3.79s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 18
% Syntax : Number of formulae : 37 ( 13 unt; 11 typ; 5 def)
% Number of atoms : 75 ( 9 equ; 0 cnn)
% Maximal formula atoms : 8 ( 2 avg)
% Number of connectives : 126 ( 23 ~; 14 |; 0 &; 87 @)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 4 avg)
% Number of types : 3 ( 1 usr)
% Number of type conns : 24 ( 24 >; 0 *; 0 +; 0 <<)
% Number of symbols : 16 ( 13 usr; 8 con; 0-3 aty)
% Number of variables : 26 ( 5 ^ 21 !; 0 ?; 26 :)
% 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(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(mvalid_type,type,
mvalid: ( $i > $o ) > $o ).
thf(mvalid_def,definition,
( mvalid
= ( '!' @ $i ) ) ).
thf(rel_b_type,type,
rel_b: $i > $i > $o ).
thf(mbox_b_type,type,
mbox_b: ( $i > $o ) > $i > $o ).
thf(mbox_b_def,definition,
( mbox_b
= ( ^ [A: $i > $o,B: $i] :
! [C: $i] :
( ~ ( rel_b @ B @ C )
| ( A @ C ) ) ) ) ).
thf(mdia_b_type,type,
mdia_b: ( $i > $o ) > $i > $o ).
thf(mdia_b_def,definition,
( mdia_b
= ( ^ [A: $i > $o] : ( mnot @ ( mbox_b @ ( mnot @ A ) ) ) ) ) ).
thf(p_type,type,
p: $i > $o ).
thf(sk1_type,type,
sk1: $i ).
thf(sk2_type,type,
sk2: $i ).
thf(sk3_type,type,
sk3: $i ).
thf(1,conjecture,
mvalid @ ( mimplies @ ( mdia_b @ ( mbox_b @ p ) ) @ ( mbox_b @ ( mdia_b @ p ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove) ).
thf(2,negated_conjecture,
~ ( mvalid @ ( mimplies @ ( mdia_b @ ( mbox_b @ p ) ) @ ( mbox_b @ ( mdia_b @ p ) ) ) ),
inference(neg_conjecture,[status(cth)],[1]) ).
thf(5,plain,
~ ! [A: $i] :
( ! [B: $i] :
( ~ ( rel_b @ A @ B )
| ~ ! [C: $i] :
( ~ ( rel_b @ B @ C )
| ( p @ C ) ) )
| ! [B: $i] :
( ~ ( rel_b @ A @ B )
| ~ ! [C: $i] :
( ~ ( rel_b @ B @ C )
| ~ ( p @ C ) ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).
thf(7,plain,
rel_b @ sk1 @ sk3,
inference(cnf,[status(esa)],[5]) ).
thf(4,axiom,
msymmetric @ rel_b,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',a2) ).
thf(13,plain,
! [A: $i,B: $i] :
( ( rel_b @ A @ B )
=> ( rel_b @ B @ A ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[4]) ).
thf(14,plain,
! [B: $i,A: $i] :
( ~ ( rel_b @ A @ B )
| ( rel_b @ B @ A ) ),
inference(cnf,[status(esa)],[13]) ).
thf(51,plain,
! [B: $i,A: $i] :
( ( rel_b @ B @ A )
| ( ( rel_b @ sk1 @ sk3 )
!= ( rel_b @ A @ B ) ) ),
inference(paramod_ordered,[status(thm)],[7,14]) ).
thf(52,plain,
rel_b @ sk3 @ sk1,
inference(pattern_uni,[status(thm)],[51:[bind(A,$thf( sk1 )),bind(B,$thf( sk3 ))]]) ).
thf(6,plain,
! [A: $i] :
( ~ ( rel_b @ sk3 @ A )
| ~ ( p @ A ) ),
inference(cnf,[status(esa)],[5]) ).
thf(10,plain,
! [A: $i] :
( ~ ( rel_b @ sk3 @ A )
| ~ ( p @ A ) ),
inference(simp,[status(thm)],[6]) ).
thf(70,plain,
! [A: $i] :
( ~ ( p @ A )
| ( ( rel_b @ sk3 @ sk1 )
!= ( rel_b @ sk3 @ A ) ) ),
inference(paramod_ordered,[status(thm)],[52,10]) ).
thf(71,plain,
~ ( p @ sk1 ),
inference(pattern_uni,[status(thm)],[70:[bind(A,$thf( sk1 ))]]) ).
thf(9,plain,
rel_b @ sk1 @ sk2,
inference(cnf,[status(esa)],[5]) ).
thf(47,plain,
! [B: $i,A: $i] :
( ( rel_b @ B @ A )
| ( ( rel_b @ sk1 @ sk2 )
!= ( rel_b @ A @ B ) ) ),
inference(paramod_ordered,[status(thm)],[9,14]) ).
thf(48,plain,
rel_b @ sk2 @ sk1,
inference(pattern_uni,[status(thm)],[47:[bind(A,$thf( sk1 )),bind(B,$thf( sk2 ))]]) ).
thf(8,plain,
! [A: $i] :
( ~ ( rel_b @ sk2 @ A )
| ( p @ A ) ),
inference(cnf,[status(esa)],[5]) ).
thf(60,plain,
! [A: $i] :
( ( p @ A )
| ( ( rel_b @ sk2 @ sk1 )
!= ( rel_b @ sk2 @ A ) ) ),
inference(paramod_ordered,[status(thm)],[48,8]) ).
thf(61,plain,
p @ sk1,
inference(pattern_uni,[status(thm)],[60:[bind(A,$thf( sk1 ))]]) ).
thf(80,plain,
~ $true,
inference(rewrite,[status(thm)],[71,61]) ).
thf(81,plain,
$false,
inference(simp,[status(thm)],[80]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.10 % Problem : SYO429^1 : TPTP v8.2.0. Released v4.0.0.
% 0.09/0.13 % Command : run_Leo-III %s %d
% 0.12/0.34 % Computer : n004.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Mon May 20 10:28:09 EDT 2024
% 0.12/0.34 % CPUTime :
% 0.91/0.87 % [INFO] Parsing problem /export/starexec/sandbox/benchmark/theBenchmark.p ...
% 1.18/1.09 % [INFO] Parsing done (219ms).
% 1.39/1.11 % [INFO] Running in sequential loop mode.
% 1.77/1.38 % [INFO] nitpick registered as external prover.
% 1.77/1.38 % [INFO] Scanning for conjecture ...
% 2.11/1.51 % [INFO] Found a conjecture (or negated_conjecture) and 2 axioms. Running axiom selection ...
% 2.11/1.53 % [INFO] Axiom selection finished. Selected 2 axioms (removed 0 axioms).
% 2.11/1.53 % [INFO] Problem is higher-order (TPTP THF).
% 2.11/1.53 % [INFO] Type checking passed.
% 2.11/1.54 % [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.74/2.14 % [INFO] Killing All external provers ...
% 3.74/2.15 % Time passed: 1639ms (effective reasoning time: 1033ms)
% 3.74/2.15 % 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.74/2.15 % Axioms used in derivation (1): a2
% 3.74/2.15 % No. of inferences in proof: 21
% 3.74/2.15 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p : 1639 ms resp. 1033 ms w/o parsing
% 3.79/2.20 % SZS output start Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 3.79/2.20 % [INFO] Killing All external provers ...
%------------------------------------------------------------------------------