TSTP Solution File: LCL700^1 by Leo-III-SAT---1.7.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Leo-III-SAT---1.7.12
% Problem : LCL700^1 : TPTP v8.2.0. Bugfixed v5.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 00:10:57 EDT 2024
% Result : Theorem 3.43s 1.92s
% Output : Refutation 3.52s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 18
% Syntax : Number of formulae : 31 ( 12 unt; 11 typ; 6 def)
% Number of atoms : 50 ( 8 equ; 0 cnn)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 102 ( 17 ~; 9 |; 0 &; 71 @)
% ( 0 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 15 ( 4 avg)
% Number of types : 3 ( 1 usr)
% Number of type conns : 52 ( 52 >; 0 *; 0 +; 0 <<)
% Number of symbols : 15 ( 13 usr; 6 con; 0-3 aty)
% Number of variables : 31 ( 11 ^ 20 !; 0 ?; 31 :)
% 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(mforall_prop_type,type,
mforall_prop: ( ( $i > $o ) > $i > $o ) > $i > $o ).
thf(mforall_prop_def,definition,
( mforall_prop
= ( ^ [A: ( $i > $o ) > $i > $o,B: $i] :
! [C: $i > $o] : ( A @ C @ B ) ) ) ).
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] : ( mnot @ ( mbox @ A @ ( mnot @ B ) ) ) ) ) ).
thf(msymmetric_type,type,
msymmetric: ( $i > $i > $o ) > $o ).
thf(msymmetric_def,definition,
( msymmetric
= ( ^ [A: $i > $i > $o] :
! [B: $i,C: $i] :
( ( A @ B @ C )
=> ( A @ C @ B ) ) ) ) ).
thf(mvalid_type,type,
mvalid: ( $i > $o ) > $o ).
thf(mvalid_def,definition,
( mvalid
= ( '!' @ $i ) ) ).
thf(sk1_type,type,
sk1: $i > $i > $o ).
thf(sk2_type,type,
sk2: $i ).
thf(sk3_type,type,
sk3: $i > $o ).
thf(sk4_type,type,
sk4: $i ).
thf(1,conjecture,
! [A: $i > $i > $o] :
( ( msymmetric @ A )
=> ( mvalid
@ ( mforall_prop
@ ^ [B: $i > $o] : ( mimplies @ B @ ( mbox @ A @ ( mdia @ A @ B ) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conj) ).
thf(2,negated_conjecture,
~ ! [A: $i > $i > $o] :
( ( msymmetric @ A )
=> ( mvalid
@ ( mforall_prop
@ ^ [B: $i > $o] : ( mimplies @ B @ ( mbox @ A @ ( mdia @ A @ B ) ) ) ) ) ),
inference(neg_conjecture,[status(cth)],[1]) ).
thf(3,plain,
~ ! [A: $i > $i > $o] :
( ! [B: $i,C: $i] :
( ( A @ B @ C )
=> ( A @ C @ B ) )
=> ! [B: $i,C: $i > $o] :
( ~ ( C @ B )
| ! [D: $i] :
( ~ ( A @ B @ D )
| ~ ! [E: $i] :
( ~ ( A @ D @ E )
| ~ ( C @ E ) ) ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).
thf(5,plain,
sk1 @ sk2 @ sk4,
inference(cnf,[status(esa)],[3]) ).
thf(7,plain,
! [B: $i,A: $i] :
( ~ ( sk1 @ A @ B )
| ( sk1 @ B @ A ) ),
inference(cnf,[status(esa)],[3]) ).
thf(17,plain,
! [B: $i,A: $i] :
( ( sk1 @ B @ A )
| ( ( sk1 @ sk2 @ sk4 )
!= ( sk1 @ A @ B ) ) ),
inference(paramod_ordered,[status(thm)],[5,7]) ).
thf(18,plain,
sk1 @ sk4 @ sk2,
inference(pattern_uni,[status(thm)],[17:[bind(A,$thf( sk2 )),bind(B,$thf( sk4 ))]]) ).
thf(6,plain,
sk3 @ sk2,
inference(cnf,[status(esa)],[3]) ).
thf(4,plain,
! [A: $i] :
( ~ ( sk1 @ sk4 @ A )
| ~ ( sk3 @ A ) ),
inference(cnf,[status(esa)],[3]) ).
thf(8,plain,
! [A: $i] :
( ~ ( sk1 @ sk4 @ A )
| ~ ( sk3 @ A ) ),
inference(simp,[status(thm)],[4]) ).
thf(10,plain,
! [A: $i] :
( ~ ( sk1 @ sk4 @ A )
| ( ( sk3 @ sk2 )
!= ( sk3 @ A ) ) ),
inference(paramod_ordered,[status(thm)],[6,8]) ).
thf(11,plain,
~ ( sk1 @ sk4 @ sk2 ),
inference(pattern_uni,[status(thm)],[10:[bind(A,$thf( sk2 ))]]) ).
thf(25,plain,
$false,
inference(rewrite,[status(thm)],[18,11]) ).
thf(26,plain,
$false,
inference(simp,[status(thm)],[25]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.13 % Problem : LCL700^1 : TPTP v8.2.0. Bugfixed v5.0.0.
% 0.11/0.16 % Command : run_Leo-III %s %d
% 0.16/0.37 % Computer : n004.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 00:59:54 EDT 2024
% 0.16/0.37 % CPUTime :
% 0.98/0.90 % [INFO] Parsing problem /export/starexec/sandbox2/benchmark/theBenchmark.p ...
% 1.34/1.06 % [INFO] Parsing done (160ms).
% 1.34/1.07 % [INFO] Running in sequential loop mode.
% 1.89/1.31 % [INFO] nitpick registered as external prover.
% 1.89/1.32 % [INFO] Scanning for conjecture ...
% 2.31/1.44 % [INFO] Found a conjecture (or negated_conjecture) and 0 axioms. Running axiom selection ...
% 2.48/1.46 % [INFO] Axiom selection finished. Selected 0 axioms (removed 0 axioms).
% 2.48/1.47 % [INFO] Problem is higher-order (TPTP THF).
% 2.48/1.47 % [INFO] Type checking passed.
% 2.48/1.47 % [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.43/1.91 % [INFO] Killing All external provers ...
% 3.43/1.91 % Time passed: 1375ms (effective reasoning time: 839ms)
% 3.43/1.91 % 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.43/1.92 % Axioms used in derivation (0):
% 3.43/1.92 % No. of inferences in proof: 14
% 3.43/1.92 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p : 1375 ms resp. 839 ms w/o parsing
% 3.52/1.95 % SZS output start Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 3.52/1.95 % [INFO] Killing All external provers ...
%------------------------------------------------------------------------------