TSTP Solution File: SYO424^1 by Leo-III-SAT---1.7.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Leo-III-SAT---1.7.12
% Problem : SYO424^1 : TPTP v8.2.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_Leo-III %s %d
% Computer : n026.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:12 EDT 2024
% Result : Theorem 3.86s 2.36s
% Output : Refutation 3.94s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 20
% Syntax : Number of formulae : 39 ( 13 unt; 12 typ; 6 def)
% Number of atoms : 91 ( 9 equ; 0 cnn)
% Maximal formula atoms : 13 ( 3 avg)
% Number of connectives : 152 ( 30 ~; 20 |; 0 &; 102 @)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 4 avg)
% Number of types : 3 ( 1 usr)
% Number of type conns : 34 ( 34 >; 0 *; 0 +; 0 <<)
% Number of symbols : 16 ( 13 usr; 5 con; 0-3 aty)
% Number of variables : 29 ( 9 ^ 18 !; 2 ?; 29 :)
% 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(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(mserial_type,type,
mserial: ( $i > $i > $o ) > $o ).
thf(mserial_def,definition,
( mserial
= ( ^ [A: $i > $i > $o] :
! [B: $i] :
? [C: $i] : ( A @ B @ C ) ) ) ).
thf(mvalid_type,type,
mvalid: ( $i > $o ) > $o ).
thf(mvalid_def,definition,
( mvalid
= ( '!' @ $i ) ) ).
thf(rel_d_type,type,
rel_d: $i > $i > $o ).
thf(mdia_d_type,type,
mdia_d: ( $i > $o ) > $i > $o ).
thf(mdia_d_def,definition,
( mdia_d
= ( ^ [A: $i > $o] : ( mnot @ ( mbox_d @ ( mnot @ A ) ) ) ) ) ).
thf(p_type,type,
p: $i > $o ).
thf(q_type,type,
q: $i > $o ).
thf(sk1_type,type,
sk1: $i ).
thf(sk2_type,type,
sk2: $i > $i ).
thf(3,axiom,
mserial @ rel_d,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a1) ).
thf(10,plain,
! [A: $i] :
? [B: $i] : ( rel_d @ A @ B ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[3]) ).
thf(11,plain,
! [A: $i] : ( rel_d @ A @ ( sk2 @ A ) ),
inference(cnf,[status(esa)],[10]) ).
thf(1,conjecture,
mvalid @ ( mor @ ( mor @ ( mdia_d @ ( mnot @ p ) ) @ ( mdia_d @ ( mnot @ q ) ) ) @ ( mdia_d @ ( mand @ p @ q ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove) ).
thf(2,negated_conjecture,
~ ( mvalid @ ( mor @ ( mor @ ( mdia_d @ ( mnot @ p ) ) @ ( mdia_d @ ( mnot @ q ) ) ) @ ( mdia_d @ ( mand @ p @ q ) ) ) ),
inference(neg_conjecture,[status(cth)],[1]) ).
thf(4,plain,
~ ! [A: $i] :
( ~ ! [B: $i] :
( ~ ( rel_d @ A @ B )
| ( p @ B ) )
| ~ ! [B: $i] :
( ~ ( rel_d @ A @ B )
| ( q @ B ) )
| ~ ! [B: $i] :
( ~ ( rel_d @ A @ B )
| ~ ( p @ B )
| ~ ( q @ B ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).
thf(6,plain,
! [A: $i] :
( ~ ( rel_d @ sk1 @ A )
| ( q @ A ) ),
inference(cnf,[status(esa)],[4]) ).
thf(9,plain,
! [A: $i] :
( ~ ( rel_d @ sk1 @ A )
| ( q @ A ) ),
inference(simp,[status(thm)],[6]) ).
thf(14,plain,
! [B: $i,A: $i] :
( ( q @ B )
| ( ( rel_d @ A @ ( sk2 @ A ) )
!= ( rel_d @ sk1 @ B ) ) ),
inference(paramod_ordered,[status(thm)],[11,9]) ).
thf(15,plain,
q @ ( sk2 @ sk1 ),
inference(pattern_uni,[status(thm)],[14:[bind(A,$thf( sk1 )),bind(B,$thf( sk2 @ sk1 ))]]) ).
thf(5,plain,
! [A: $i] :
( ~ ( rel_d @ sk1 @ A )
| ~ ( p @ A )
| ~ ( q @ A ) ),
inference(cnf,[status(esa)],[4]) ).
thf(8,plain,
! [A: $i] :
( ~ ( rel_d @ sk1 @ A )
| ~ ( p @ A )
| ~ ( q @ A ) ),
inference(simp,[status(thm)],[5]) ).
thf(18,plain,
! [B: $i,A: $i] :
( ~ ( p @ B )
| ~ ( q @ B )
| ( ( rel_d @ A @ ( sk2 @ A ) )
!= ( rel_d @ sk1 @ B ) ) ),
inference(paramod_ordered,[status(thm)],[11,8]) ).
thf(19,plain,
( ~ ( p @ ( sk2 @ sk1 ) )
| ~ ( q @ ( sk2 @ sk1 ) ) ),
inference(pattern_uni,[status(thm)],[18:[bind(A,$thf( sk1 )),bind(B,$thf( sk2 @ sk1 ))]]) ).
thf(7,plain,
! [A: $i] :
( ~ ( rel_d @ sk1 @ A )
| ( p @ A ) ),
inference(cnf,[status(esa)],[4]) ).
thf(12,plain,
! [B: $i,A: $i] :
( ( p @ B )
| ( ( rel_d @ A @ ( sk2 @ A ) )
!= ( rel_d @ sk1 @ B ) ) ),
inference(paramod_ordered,[status(thm)],[11,7]) ).
thf(13,plain,
p @ ( sk2 @ sk1 ),
inference(pattern_uni,[status(thm)],[12:[bind(A,$thf( sk1 )),bind(B,$thf( sk2 @ sk1 ))]]) ).
thf(20,plain,
( ~ $true
| ~ ( q @ ( sk2 @ sk1 ) ) ),
inference(rewrite,[status(thm)],[19,13]) ).
thf(21,plain,
~ ( q @ ( sk2 @ sk1 ) ),
inference(simp,[status(thm)],[20]) ).
thf(22,plain,
$false,
inference(rewrite,[status(thm)],[15,21]) ).
thf(23,plain,
$false,
inference(simp,[status(thm)],[22]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.09 % Problem : SYO424^1 : TPTP v8.2.0. Released v4.0.0.
% 0.05/0.12 % Command : run_Leo-III %s %d
% 0.12/0.32 % Computer : n026.cluster.edu
% 0.12/0.32 % Model : x86_64 x86_64
% 0.12/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.32 % Memory : 8042.1875MB
% 0.12/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.32 % CPULimit : 300
% 0.12/0.32 % WCLimit : 300
% 0.12/0.32 % DateTime : Mon May 20 09:36:09 EDT 2024
% 0.12/0.32 % CPUTime :
% 1.02/0.95 % [INFO] Parsing problem /export/starexec/sandbox2/benchmark/theBenchmark.p ...
% 1.57/1.20 % [INFO] Parsing done (243ms).
% 1.57/1.21 % [INFO] Running in sequential loop mode.
% 2.18/1.59 % [INFO] nitpick registered as external prover.
% 2.18/1.60 % [INFO] Scanning for conjecture ...
% 2.69/1.78 % [INFO] Found a conjecture (or negated_conjecture) and 1 axioms. Running axiom selection ...
% 2.69/1.81 % [INFO] Axiom selection finished. Selected 1 axioms (removed 0 axioms).
% 2.69/1.81 % [INFO] Problem is higher-order (TPTP THF).
% 2.79/1.81 % [INFO] Type checking passed.
% 2.79/1.82 % [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.79/2.36 % [INFO] Killing All external provers ...
% 3.79/2.36 % Time passed: 1886ms (effective reasoning time: 1138ms)
% 3.79/2.36 % 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.86/2.36 % Axioms used in derivation (1): a1
% 3.86/2.36 % No. of inferences in proof: 21
% 3.86/2.36 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p : 1886 ms resp. 1138 ms w/o parsing
% 3.94/2.42 % SZS output start Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 3.94/2.42 % [INFO] Killing All external provers ...
%------------------------------------------------------------------------------