TSTP Solution File: SYO460^3 by Leo-III-SAT---1.7.15
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Leo-III-SAT---1.7.15
% Problem : SYO460^3 : TPTP v8.2.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_Leo-III %s %d SAT
% Computer : n023.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 : Mon Jun 24 20:55:38 EDT 2024
% Result : Theorem 3.42s 1.81s
% Output : Refutation 3.54s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 6
% Syntax : Number of formulae : 23 ( 8 unt; 0 typ; 5 def)
% Number of atoms : 89 ( 8 equ; 0 cnn)
% Maximal formula atoms : 13 ( 3 avg)
% Number of connectives : 125 ( 30 ~; 22 |; 0 &; 73 @)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 4 avg)
% Number of types : 3 ( 1 usr)
% Number of type conns : 6 ( 6 >; 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_m_type,type,
rel_m: $i > $i > $o ).
thf(mdia_m_type,type,
mdia_m: ( $i > $o ) > $i > $o ).
thf(mdia_m_def,definition,
( mdia_m
= ( ^ [A: $i > $o] : ( mnot @ ( mbox_m @ ( 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_m @ ( mand @ p @ q ) ) @ ( mdia_m @ ( mand @ p @ r ) ) ) @ ( mdia_m @ p ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove) ).
thf(2,negated_conjecture,
~ ( mvalid @ ( mimplies @ ( mor @ ( mdia_m @ ( mand @ p @ q ) ) @ ( mdia_m @ ( mand @ p @ r ) ) ) @ ( mdia_m @ p ) ) ),
inference(neg_conjecture,[status(cth)],[1]) ).
thf(4,plain,
~ ! [A: $i] :
( ~ ( ~ ! [B: $i] :
( ~ ( rel_m @ A @ B )
| ~ ( p @ B )
| ~ ( q @ B ) )
| ~ ! [B: $i] :
( ~ ( rel_m @ A @ B )
| ~ ( p @ B )
| ~ ( r @ B ) ) )
| ~ ! [B: $i] :
( ~ ( rel_m @ A @ B )
| ~ ( p @ B ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).
thf(6,plain,
( ~ sk2
| ( rel_m @ sk1 @ sk4 ) ),
inference(cnf,[status(esa)],[4]) ).
thf(5,plain,
! [A: $i] :
( ~ ( rel_m @ sk1 @ A )
| ~ ( p @ A ) ),
inference(cnf,[status(esa)],[4]) ).
thf(26,plain,
! [A: $i] :
( ~ sk2
| ~ ( p @ A )
| ( ( rel_m @ sk1 @ sk4 )
!= ( rel_m @ sk1 @ A ) ) ),
inference(paramod_ordered,[status(thm)],[6,5]) ).
thf(27,plain,
( ~ sk2
| ~ ( p @ sk4 ) ),
inference(pattern_uni,[status(thm)],[26:[bind(A,$thf( sk4 ))]]) ).
thf(9,plain,
( ~ sk2
| ( p @ sk4 ) ),
inference(cnf,[status(esa)],[4]) ).
thf(10,plain,
( ( p @ sk3 )
| sk2 ),
inference(cnf,[status(esa)],[4]) ).
thf(8,plain,
( ( rel_m @ sk1 @ sk3 )
| sk2 ),
inference(cnf,[status(esa)],[4]) ).
thf(24,plain,
! [A: $i] :
( sk2
| ~ ( p @ A )
| ( ( rel_m @ sk1 @ sk3 )
!= ( rel_m @ sk1 @ A ) ) ),
inference(paramod_ordered,[status(thm)],[8,5]) ).
thf(25,plain,
( sk2
| ~ ( p @ sk3 ) ),
inference(pattern_uni,[status(thm)],[24:[bind(A,$thf( sk3 ))]]) ).
thf(28,plain,
( sk2
| ( ( p @ sk3 )
!= ( p @ sk3 ) ) ),
inference(paramod_ordered,[status(thm)],[10,25]) ).
thf(29,plain,
sk2,
inference(pattern_uni,[status(thm)],[28:[]]) ).
thf(33,plain,
( ~ $true
| ( p @ sk4 ) ),
inference(rewrite,[status(thm)],[9,29]) ).
thf(34,plain,
p @ sk4,
inference(simp,[status(thm)],[33]) ).
thf(43,plain,
( ~ $true
| ~ $true ),
inference(rewrite,[status(thm)],[27,34,29]) ).
thf(44,plain,
$false,
inference(simp,[status(thm)],[43]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SYO460^3 : TPTP v8.2.0. Released v4.0.0.
% 0.07/0.12 % Command : run_Leo-III %s %d SAT
% 0.11/0.32 % Computer : n023.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 300
% 0.11/0.32 % WCLimit : 300
% 0.11/0.32 % DateTime : Sun Jun 23 10:50:25 EDT 2024
% 0.11/0.33 % CPUTime :
% 0.97/0.85 % [INFO] Parsing problem /export/starexec/sandbox2/benchmark/theBenchmark.p ...
% 1.40/1.00 % [INFO] Parsing done (156ms).
% 1.40/1.01 % [INFO] Running in sequential loop mode.
% 1.79/1.22 % [INFO] nitpick registered as external prover.
% 1.79/1.23 % [INFO] Scanning for conjecture ...
% 2.27/1.33 % [INFO] Found a conjecture (or negated_conjecture) and 1 axioms. Running axiom selection ...
% 2.27/1.35 % [INFO] Axiom selection finished. Selected 1 axioms (removed 0 axioms).
% 2.35/1.35 % [INFO] Problem is higher-order (TPTP THF).
% 2.35/1.36 % [INFO] Type checking passed.
% 2.35/1.36 % [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.42/1.81 % [INFO] Killing All external provers ...
% 3.42/1.81 % Time passed: 1293ms (effective reasoning time: 791ms)
% 3.42/1.81 % 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.42/1.81 % Axioms used in derivation (0):
% 3.42/1.81 % No. of inferences in proof: 18
% 3.42/1.81 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p : 1293 ms resp. 791 ms w/o parsing
% 3.54/1.84 % SZS output start Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 3.54/1.84 % [INFO] Killing All external provers ...
%------------------------------------------------------------------------------