TSTP Solution File: SYO416^1 by Leo-III-SAT---1.7.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Leo-III-SAT---1.7.12
% Problem : SYO416^1 : TPTP v8.2.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_Leo-III %s %d
% Computer : n006.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:11 EDT 2024
% Result : Theorem 3.44s 1.77s
% Output : Refutation 3.44s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 18
% Syntax : Number of formulae : 35 ( 12 unt; 11 typ; 5 def)
% Number of atoms : 72 ( 8 equ; 0 cnn)
% Maximal formula atoms : 8 ( 3 avg)
% Number of connectives : 123 ( 24 ~; 16 |; 0 &; 83 @)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 4 avg)
% Number of types : 3 ( 1 usr)
% Number of type conns : 25 ( 25 >; 0 *; 0 +; 0 <<)
% Number of symbols : 15 ( 13 usr; 6 con; 0-3 aty)
% Number of variables : 28 ( 5 ^ 21 !; 2 ?; 28 :)
% 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(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(mbox_d_type,type,
mbox_d: ( $i > $o ) > $i > $o ).
thf(mbox_d_def,definition,
( mbox_d
= ( ^ [A: $i > $o,B: $i] :
! [C: $i] :
( ~ ( rel_d @ B @ C )
| ( A @ C ) ) ) ) ).
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(sk1_type,type,
sk1: $i ).
thf(sk2_type,type,
sk2: $i ).
thf(sk3_type,type,
sk3: $i > $i ).
thf(3,axiom,
mserial @ rel_d,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a1) ).
thf(9,plain,
! [A: $i] :
? [B: $i] : ( rel_d @ A @ B ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[3]) ).
thf(10,plain,
! [A: $i] : ( rel_d @ A @ ( sk3 @ A ) ),
inference(cnf,[status(esa)],[9]) ).
thf(1,conjecture,
mvalid @ ( mimplies @ ( mbox_d @ ( mbox_d @ p ) ) @ ( mbox_d @ ( mdia_d @ p ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove) ).
thf(2,negated_conjecture,
~ ( mvalid @ ( mimplies @ ( mbox_d @ ( mbox_d @ p ) ) @ ( mbox_d @ ( mdia_d @ p ) ) ) ),
inference(neg_conjecture,[status(cth)],[1]) ).
thf(4,plain,
~ ! [A: $i] :
( ~ ! [B: $i] :
( ~ ( rel_d @ A @ B )
| ! [C: $i] :
( ~ ( rel_d @ B @ C )
| ( p @ C ) ) )
| ! [B: $i] :
( ~ ( rel_d @ A @ B )
| ~ ! [C: $i] :
( ~ ( rel_d @ B @ C )
| ~ ( p @ C ) ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).
thf(6,plain,
rel_d @ sk1 @ sk2,
inference(cnf,[status(esa)],[4]) ).
thf(7,plain,
! [B: $i,A: $i] :
( ~ ( rel_d @ sk1 @ A )
| ~ ( rel_d @ A @ B )
| ( p @ B ) ),
inference(cnf,[status(esa)],[4]) ).
thf(20,plain,
! [B: $i,A: $i] :
( ~ ( rel_d @ A @ B )
| ( p @ B )
| ( ( rel_d @ sk1 @ sk2 )
!= ( rel_d @ sk1 @ A ) ) ),
inference(paramod_ordered,[status(thm)],[6,7]) ).
thf(21,plain,
! [A: $i] :
( ~ ( rel_d @ sk2 @ A )
| ( p @ A ) ),
inference(pattern_uni,[status(thm)],[20:[bind(A,$thf( sk2 ))]]) ).
thf(28,plain,
! [A: $i] :
( ~ ( rel_d @ sk2 @ A )
| ( p @ A ) ),
inference(simp,[status(thm)],[21]) ).
thf(47,plain,
! [B: $i,A: $i] :
( ( p @ B )
| ( ( rel_d @ A @ ( sk3 @ A ) )
!= ( rel_d @ sk2 @ B ) ) ),
inference(paramod_ordered,[status(thm)],[10,28]) ).
thf(48,plain,
p @ ( sk3 @ sk2 ),
inference(pattern_uni,[status(thm)],[47:[bind(A,$thf( sk2 )),bind(B,$thf( sk3 @ sk2 ))]]) ).
thf(5,plain,
! [A: $i] :
( ~ ( rel_d @ sk2 @ A )
| ~ ( p @ A ) ),
inference(cnf,[status(esa)],[4]) ).
thf(8,plain,
! [A: $i] :
( ~ ( rel_d @ sk2 @ A )
| ~ ( p @ A ) ),
inference(simp,[status(thm)],[5]) ).
thf(12,plain,
! [B: $i,A: $i] :
( ~ ( p @ B )
| ( ( rel_d @ A @ ( sk3 @ A ) )
!= ( rel_d @ sk2 @ B ) ) ),
inference(paramod_ordered,[status(thm)],[10,8]) ).
thf(13,plain,
~ ( p @ ( sk3 @ sk2 ) ),
inference(pattern_uni,[status(thm)],[12:[bind(A,$thf( sk2 )),bind(B,$thf( sk3 @ sk2 ))]]) ).
thf(52,plain,
$false,
inference(rewrite,[status(thm)],[48,13]) ).
thf(53,plain,
$false,
inference(simp,[status(thm)],[52]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SYO416^1 : TPTP v8.2.0. Released v4.0.0.
% 0.16/0.16 % Command : run_Leo-III %s %d
% 0.16/0.37 % Computer : n006.cluster.edu
% 0.16/0.37 % Model : x86_64 x86_64
% 0.16/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.37 % Memory : 8042.1875MB
% 0.16/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.37 % CPULimit : 300
% 0.16/0.37 % WCLimit : 300
% 0.16/0.37 % DateTime : Mon May 20 10:34:39 EDT 2024
% 0.16/0.37 % CPUTime :
% 0.98/0.87 % [INFO] Parsing problem /export/starexec/sandbox2/benchmark/theBenchmark.p ...
% 1.29/1.01 % [INFO] Parsing done (141ms).
% 1.29/1.02 % [INFO] Running in sequential loop mode.
% 1.79/1.21 % [INFO] nitpick registered as external prover.
% 1.79/1.22 % [INFO] Scanning for conjecture ...
% 1.99/1.32 % [INFO] Found a conjecture (or negated_conjecture) and 1 axioms. Running axiom selection ...
% 2.23/1.34 % [INFO] Axiom selection finished. Selected 1 axioms (removed 0 axioms).
% 2.23/1.34 % [INFO] Problem is higher-order (TPTP THF).
% 2.23/1.34 % [INFO] Type checking passed.
% 2.23/1.34 % [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.44/1.77 % [INFO] Killing All external provers ...
% 3.44/1.77 % Time passed: 1233ms (effective reasoning time: 746ms)
% 3.44/1.77 % 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.44/1.77 % Axioms used in derivation (1): a1
% 3.44/1.77 % No. of inferences in proof: 19
% 3.44/1.77 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p : 1233 ms resp. 746 ms w/o parsing
% 3.44/1.81 % SZS output start Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 3.44/1.81 % [INFO] Killing All external provers ...
%------------------------------------------------------------------------------