TSTP Solution File: SYO053^2 by Leo-III---1.7.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Leo-III---1.7.12
% Problem : SYO053^2 : TPTP v8.2.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_Leo-III %s %d
% Computer : n027.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 08:55:36 EDT 2024
% Result : Theorem 3.19s 1.71s
% Output : Refutation 3.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 8
% Syntax : Number of formulae : 14 ( 6 unt; 4 typ; 3 def)
% Number of atoms : 20 ( 3 equ; 0 cnn)
% Maximal formula atoms : 3 ( 2 avg)
% Number of connectives : 30 ( 11 ~; 0 |; 0 &; 19 @)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 4 avg)
% Number of types : 3 ( 1 usr)
% Number of type conns : 22 ( 22 >; 0 *; 0 +; 0 <<)
% Number of symbols : 10 ( 7 usr; 6 con; 0-3 aty)
% Number of variables : 13 ( 3 ^ 6 !; 4 ?; 13 :)
% Comments :
%------------------------------------------------------------------------------
thf(mu_type,type,
mu: $tType ).
thf(mtrue_type,type,
mtrue: $i > $o ).
thf(mtrue_def,definition,
( mtrue
= ( ^ [A: $i] : $true ) ) ).
thf(mdia_type,type,
mdia: ( $i > $i > $o ) > ( $i > $o ) > $i > $o ).
thf(mdia_def,definition,
( mdia
= ( ^ [A: $i > $i > $o,B: $i > $o] : ( mnot @ ( mbox @ A @ ( mnot @ B ) ) ) ) ) ).
thf(mvalid_type,type,
mvalid: ( $i > $o ) > $o ).
thf(mvalid_def,definition,
( mvalid
= ( '!' @ $i ) ) ).
thf(1,conjecture,
? [A: $i > $i > $o] :
~ ( mvalid @ ( mdia @ A @ mtrue ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conj) ).
thf(2,negated_conjecture,
~ ? [A: $i > $i > $o] :
~ ( mvalid @ ( mdia @ A @ mtrue ) ),
inference(neg_conjecture,[status(cth)],[1]) ).
thf(3,plain,
~ ? [A: $i > $i > $o] :
~ ! [B: $i] :
~ ! [C: $i] :
~ ( A @ B @ C ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).
thf(4,plain,
~ ~ ~ ~ ! [A: $i > $i > $o,B: $i] :
? [C: $i] : ( A @ B @ C ),
inference(miniscope,[status(thm)],[3]) ).
thf(5,plain,
! [B: $i,A: $i > $i > $o] : ( A @ B @ ( sk1 @ B @ A ) ),
inference(cnf,[status(esa)],[4]) ).
thf(7,plain,
$false,
inference(prim_subst,[status(thm)],[5:[bind(A,$thf( ^ [C: $i] : ^ [D: $i] : $false ))]]) ).
thf(12,plain,
$false,
inference(simp,[status(thm)],[7]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : SYO053^2 : TPTP v8.2.0. Released v4.0.0.
% 0.06/0.15 % Command : run_Leo-III %s %d
% 0.16/0.36 % Computer : n027.cluster.edu
% 0.16/0.36 % Model : x86_64 x86_64
% 0.16/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.36 % Memory : 8042.1875MB
% 0.16/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.36 % CPULimit : 300
% 0.16/0.36 % WCLimit : 300
% 0.16/0.36 % DateTime : Mon May 20 10:03:24 EDT 2024
% 0.16/0.36 % CPUTime :
% 0.96/0.85 % [INFO] Parsing problem /export/starexec/sandbox2/benchmark/theBenchmark.p ...
% 1.43/1.00 % [INFO] Parsing done (141ms).
% 1.43/1.01 % [INFO] Running in sequential loop mode.
% 1.98/1.24 % [INFO] eprover registered as external prover.
% 1.98/1.24 % [INFO] cvc4 registered as external prover.
% 1.98/1.25 % [INFO] Scanning for conjecture ...
% 2.25/1.35 % [INFO] Found a conjecture (or negated_conjecture) and 0 axioms. Running axiom selection ...
% 2.34/1.37 % [INFO] Axiom selection finished. Selected 0 axioms (removed 0 axioms).
% 2.34/1.37 % [INFO] Problem is higher-order (TPTP THF).
% 2.34/1.37 % [INFO] Type checking passed.
% 2.34/1.37 % [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.19/1.70 % [INFO] Killing All external provers ...
% 3.19/1.71 % Time passed: 1188ms (effective reasoning time: 689ms)
% 3.19/1.71 % 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.19/1.71 % Axioms used in derivation (0):
% 3.19/1.71 % No. of inferences in proof: 7
% 3.19/1.71 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p : 1188 ms resp. 689 ms w/o parsing
% 3.19/1.74 % SZS output start Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 3.19/1.74 % [INFO] Killing All external provers ...
%------------------------------------------------------------------------------