TSTP Solution File: SYO481^6 by Leo-III-SAT---1.7.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Leo-III-SAT---1.7.12
% Problem : SYO481^6 : 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:39 EDT 2024
% Result : Theorem 2.83s 1.56s
% Output : Refutation 2.83s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 17
% Syntax : Number of formulae : 26 ( 12 unt; 10 typ; 6 def)
% Number of atoms : 47 ( 16 equ; 0 cnn)
% Maximal formula atoms : 9 ( 2 avg)
% Number of connectives : 54 ( 12 ~; 5 |; 0 &; 37 @)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 4 avg)
% Number of types : 3 ( 1 usr)
% Number of type conns : 27 ( 27 >; 0 *; 0 +; 0 <<)
% Number of symbols : 13 ( 11 usr; 5 con; 0-3 aty)
% Number of variables : 24 ( 14 ^ 9 !; 1 ?; 24 :)
% Comments :
%------------------------------------------------------------------------------
thf(mu_type,type,
mu: $tType ).
thf(meq_ind_type,type,
meq_ind: mu > mu > $i > $o ).
thf(meq_ind_def,definition,
( meq_ind
= ( ^ [A: mu,B: mu,C: $i] : ( A = B ) ) ) ).
thf(mnot_type,type,
mnot: ( $i > $o ) > $i > $o ).
thf(mnot_def,definition,
( mnot
= ( ^ [A: $i > $o,B: $i] :
~ ( A @ B ) ) ) ).
thf(mimplies_type,type,
mimplies: ( $i > $o ) > ( $i > $o ) > $i > $o ).
thf(mimplies_def,definition,
( mimplies
= ( ^ [A: $i > $o] : ( mor @ ( mnot @ A ) ) ) ) ).
thf(mforall_ind_type,type,
mforall_ind: ( mu > $i > $o ) > $i > $o ).
thf(mforall_ind_def,definition,
( mforall_ind
= ( ^ [A: mu > $i > $o,B: $i] :
! [C: mu] : ( A @ C @ B ) ) ) ).
thf(mvalid_type,type,
mvalid: ( $i > $o ) > $o ).
thf(mvalid_def,definition,
( mvalid
= ( '!' @ $i ) ) ).
thf(rel_s5_type,type,
rel_s5: $i > $i > $o ).
thf(mbox_s5_type,type,
mbox_s5: ( $i > $o ) > $i > $o ).
thf(mbox_s5_def,definition,
( mbox_s5
= ( ^ [A: $i > $o,B: $i] :
! [C: $i] :
( ~ ( rel_s5 @ B @ C )
| ( A @ C ) ) ) ) ).
thf(sk2_type,type,
sk2: mu ).
thf(sk3_type,type,
sk3: mu ).
thf(1,conjecture,
( mvalid
@ ( mforall_ind
@ ^ [A: mu] :
( mforall_ind
@ ^ [B: mu] : ( mimplies @ ( mnot @ ( meq_ind @ A @ B ) ) @ ( mbox_s5 @ ( mnot @ ( meq_ind @ A @ B ) ) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove) ).
thf(2,negated_conjecture,
~ ( mvalid
@ ( mforall_ind
@ ^ [A: mu] :
( mforall_ind
@ ^ [B: mu] : ( mimplies @ ( mnot @ ( meq_ind @ A @ B ) ) @ ( mbox_s5 @ ( mnot @ ( meq_ind @ A @ B ) ) ) ) ) ) ),
inference(neg_conjecture,[status(cth)],[1]) ).
thf(6,plain,
~ ! [A: $i,B: mu,C: mu] :
( ( B = C )
| ! [D: $i] :
( ~ ( rel_s5 @ A @ D )
| ( B != C ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).
thf(7,plain,
~ ! [A: $i,B: mu,C: mu] :
( ( B = C )
| ~ ? [D: $i] : ( rel_s5 @ A @ D )
| ( B != C ) ),
inference(miniscope,[status(thm)],[6]) ).
thf(10,plain,
sk2 != sk3,
inference(cnf,[status(esa)],[7]) ).
thf(12,plain,
sk3 != sk2,
inference(lifteq,[status(thm)],[10]) ).
thf(8,plain,
sk2 = sk3,
inference(cnf,[status(esa)],[7]) ).
thf(11,plain,
sk3 = sk2,
inference(lifteq,[status(thm)],[8]) ).
thf(19,plain,
sk2 != sk2,
inference(rewrite,[status(thm)],[12,11]) ).
thf(20,plain,
$false,
inference(simp,[status(thm)],[19]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SYO481^6 : TPTP v8.2.0. Released v4.0.0.
% 0.11/0.15 % Command : run_Leo-III %s %d
% 0.15/0.36 % Computer : n004.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 300
% 0.15/0.36 % DateTime : Mon May 20 10:17:09 EDT 2024
% 0.15/0.36 % CPUTime :
% 0.90/0.86 % [INFO] Parsing problem /export/starexec/sandbox2/benchmark/theBenchmark.p ...
% 1.20/1.01 % [INFO] Parsing done (149ms).
% 1.20/1.02 % [INFO] Running in sequential loop mode.
% 1.94/1.23 % [INFO] nitpick registered as external prover.
% 1.94/1.23 % [INFO] Scanning for conjecture ...
% 2.26/1.34 % [INFO] Found a conjecture (or negated_conjecture) and 3 axioms. Running axiom selection ...
% 2.26/1.36 % [INFO] Axiom selection finished. Selected 3 axioms (removed 0 axioms).
% 2.26/1.36 % [INFO] Problem is higher-order (TPTP THF).
% 2.26/1.36 % [INFO] Type checking passed.
% 2.26/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 ...
% 2.83/1.56 % [INFO] Killing All external provers ...
% 2.83/1.56 % Time passed: 1038ms (effective reasoning time: 538ms)
% 2.83/1.56 % 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)>
% 2.83/1.56 % Axioms used in derivation (0):
% 2.83/1.56 % No. of inferences in proof: 10
% 2.83/1.56 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p : 1038 ms resp. 538 ms w/o parsing
% 2.83/1.59 % SZS output start Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 2.83/1.59 % [INFO] Killing All external provers ...
%------------------------------------------------------------------------------