TSTP Solution File: LCL588^1 by Leo-III-SAT---1.7.15
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Leo-III-SAT---1.7.15
% Problem : LCL588^1 : TPTP v8.2.0. Released v3.6.0.
% Transfm : none
% Format : tptp:raw
% Command : run_Leo-III %s %d SAT
% Computer : n032.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 11:18:32 EDT 2024
% Result : Theorem 2.18s 1.43s
% Output : Refutation 2.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 5
% Syntax : Number of formulae : 19 ( 10 unt; 0 typ; 4 def)
% Number of atoms : 74 ( 6 equ; 0 cnn)
% Maximal formula atoms : 14 ( 3 avg)
% Number of connectives : 121 ( 22 ~; 15 |; 2 &; 79 @)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 4 avg)
% Number of types : 3 ( 1 usr)
% Number of type conns : 7 ( 7 >; 0 *; 0 +; 0 <<)
% Number of symbols : 15 ( 12 usr; 7 con; 0-3 aty)
% Number of variables : 21 ( 7 ^ 12 !; 2 ?; 21 :)
% Comments :
%------------------------------------------------------------------------------
thf(mimpl_type,type,
mimpl: ( $i > $o ) > ( $i > $o ) > $i > $o ).
thf(mimpl_def,definition,
( mimpl
= ( ^ [A: $i > $o] : ( mor @ ( mnot @ A ) ) ) ) ).
thf(mbox_type,type,
mbox: ( $i > $i > $o ) > ( $i > $o ) > $i > $o ).
thf(mbox_def,definition,
( mbox
= ( ^ [A: $i > $i > $o,B: $i > $o,C: $i] :
! [D: $i] :
( ( A @ C @ D )
=> ( B @ D ) ) ) ) ).
thf(mdia_type,type,
mdia: ( $i > $i > $o ) > ( $i > $o ) > $i > $o ).
thf(mdia_def,definition,
( mdia
= ( ^ [A: $i > $i > $o,B: $i > $o,C: $i] :
? [D: $i] :
( ( A @ C @ D )
& ( B @ D ) ) ) ) ).
thf(individuals_type,type,
individuals: $tType ).
thf(mvalid_type,type,
mvalid: ( $i > $o ) > $o ).
thf(mvalid_def,definition,
( mvalid
= ( '!' @ $i ) ) ).
thf(a_type,type,
a: $i > $o ).
thf(b_type,type,
b: $i > $o ).
thf(r_type,type,
r: $i > $i > $o ).
thf(sk1_type,type,
sk1: $i ).
thf(sk2_type,type,
sk2: $i ).
thf(1,conjecture,
mvalid @ ( mimpl @ ( mimpl @ ( mdia @ r @ a ) @ ( mbox @ r @ b ) ) @ ( mbox @ r @ ( mimpl @ a @ b ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',thm) ).
thf(2,negated_conjecture,
~ ( mvalid @ ( mimpl @ ( mimpl @ ( mdia @ r @ a ) @ ( mbox @ r @ b ) ) @ ( mbox @ r @ ( mimpl @ a @ b ) ) ) ),
inference(neg_conjecture,[status(cth)],[1]) ).
thf(3,plain,
~ ! [A: $i] :
( ~ ( ~ ? [B: $i] :
( ( r @ A @ B )
& ( a @ B ) )
| ! [B: $i] :
( ( r @ A @ B )
=> ( b @ B ) ) )
| ! [B: $i] :
( ( r @ A @ B )
=> ( ~ ( a @ B )
| ( b @ B ) ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).
thf(6,plain,
r @ sk1 @ sk2,
inference(cnf,[status(esa)],[3]) ).
thf(7,plain,
! [B: $i,A: $i] :
( ~ ( r @ sk1 @ A )
| ~ ( a @ A )
| ~ ( r @ sk1 @ B )
| ( b @ B ) ),
inference(cnf,[status(esa)],[3]) ).
thf(12,plain,
! [B: $i,A: $i] :
( ~ ( r @ sk1 @ A )
| ~ ( a @ A )
| ( b @ B )
| ( ( r @ sk1 @ sk2 )
!= ( r @ sk1 @ B ) ) ),
inference(paramod_ordered,[status(thm)],[6,7]) ).
thf(13,plain,
! [A: $i] :
( ~ ( r @ sk1 @ A )
| ~ ( a @ A )
| ( b @ sk2 ) ),
inference(pattern_uni,[status(thm)],[12:[bind(A,$thf( A )),bind(B,$thf( sk2 ))]]) ).
thf(4,plain,
~ ( b @ sk2 ),
inference(cnf,[status(esa)],[3]) ).
thf(19,plain,
! [A: $i] :
( ~ ( r @ sk1 @ A )
| ~ ( a @ A )
| $false ),
inference(rewrite,[status(thm)],[13,4]) ).
thf(20,plain,
! [A: $i] :
( ~ ( r @ sk1 @ A )
| ~ ( a @ A ) ),
inference(simp,[status(thm)],[19]) ).
thf(23,plain,
! [A: $i] :
( ~ ( a @ A )
| ( ( r @ sk1 @ sk2 )
!= ( r @ sk1 @ A ) ) ),
inference(paramod_ordered,[status(thm)],[6,20]) ).
thf(24,plain,
~ ( a @ sk2 ),
inference(pattern_uni,[status(thm)],[23:[bind(A,$thf( sk2 ))]]) ).
thf(5,plain,
a @ sk2,
inference(cnf,[status(esa)],[3]) ).
thf(25,plain,
~ $true,
inference(rewrite,[status(thm)],[24,5]) ).
thf(26,plain,
$false,
inference(simp,[status(thm)],[25]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.09 % Problem : LCL588^1 : TPTP v8.2.0. Released v3.6.0.
% 0.02/0.09 % Command : run_Leo-III %s %d SAT
% 0.09/0.28 % Computer : n032.cluster.edu
% 0.09/0.28 % Model : x86_64 x86_64
% 0.09/0.28 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.28 % Memory : 8042.1875MB
% 0.09/0.28 % OS : Linux 3.10.0-693.el7.x86_64
% 0.09/0.28 % CPULimit : 300
% 0.09/0.28 % WCLimit : 300
% 0.09/0.28 % DateTime : Sat Jun 22 16:08:10 EDT 2024
% 0.09/0.28 % CPUTime :
% 0.65/0.68 % [INFO] Parsing problem /export/starexec/sandbox/benchmark/theBenchmark.p ...
% 0.89/0.80 % [INFO] Parsing done (116ms).
% 0.89/0.80 % [INFO] Running in sequential loop mode.
% 1.37/1.01 % [INFO] nitpick registered as external prover.
% 1.37/1.02 % [INFO] Scanning for conjecture ...
% 1.54/1.09 % [INFO] Found a conjecture (or negated_conjecture) and 0 axioms. Running axiom selection ...
% 1.54/1.11 % [INFO] Axiom selection finished. Selected 0 axioms (removed 0 axioms).
% 1.54/1.11 % [INFO] Problem is higher-order (TPTP THF).
% 1.54/1.11 % [INFO] Type checking passed.
% 1.54/1.11 % [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.18/1.42 % [INFO] Killing All external provers ...
% 2.18/1.43 % Time passed: 1022ms (effective reasoning time: 618ms)
% 2.18/1.43 % 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.18/1.43 % Axioms used in derivation (0):
% 2.18/1.43 % No. of inferences in proof: 15
% 2.18/1.43 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p : 1022 ms resp. 618 ms w/o parsing
% 2.18/1.46 % SZS output start Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 2.18/1.46 % [INFO] Killing All external provers ...
%------------------------------------------------------------------------------