TSTP Solution File: SYO266^5 by Leo-III---1.7.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Leo-III---1.7.12
% Problem : SYO266^5 : TPTP v8.2.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_Leo-III %s %d
% Computer : n028.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:56:16 EDT 2024
% Result : Theorem 5.25s 2.16s
% Output : Refutation 5.49s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 6
% Syntax : Number of formulae : 23 ( 5 unt; 5 typ; 0 def)
% Number of atoms : 81 ( 7 equ; 0 cnn)
% Maximal formula atoms : 8 ( 4 avg)
% Number of connectives : 188 ( 39 ~; 43 |; 6 &; 100 @)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 6 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 18 ( 18 >; 0 *; 0 +; 0 <<)
% Number of symbols : 8 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 35 ( 10 ^ 19 !; 6 ?; 35 :)
% Comments :
%------------------------------------------------------------------------------
thf(cQ_type,type,
cQ: $i > $o ).
thf(cP_type,type,
cP: $i > $o ).
thf(sk1_type,type,
sk1: ( $i > $o ) > $i ).
thf(sk2_type,type,
sk2: ( $i > $o ) > $i ).
thf(sk3_type,type,
sk3: $i > $o ).
thf(1,conjecture,
( ( ? [A: $i > $o] :
! [B: $i] :
( ( ( A @ B )
| ( cP @ B ) )
& ( ~ ( A @ B )
| ( cQ @ B ) ) ) )
= ( ! [A: $i] :
( ( cP @ A )
| ( cQ @ A ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cTHM44) ).
thf(2,negated_conjecture,
( ( ? [A: $i > $o] :
! [B: $i] :
( ( ( A @ B )
| ( cP @ B ) )
& ( ~ ( A @ B )
| ( cQ @ B ) ) ) )
!= ( ! [A: $i] :
( ( cP @ A )
| ( cQ @ A ) ) ) ),
inference(neg_conjecture,[status(cth)],[1]) ).
thf(3,plain,
( ( ? [A: $i > $o] :
! [B: $i] :
( ( ( A @ B )
| ( cP @ B ) )
& ( ~ ( A @ B )
| ( cQ @ B ) ) ) )
!= ( ! [A: $i] :
( ( cP @ A )
| ( cQ @ A ) ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).
thf(4,plain,
( ( ? [A: $i > $o] :
! [B: $i] :
( ( ( A @ B )
| ( cP @ B ) )
& ( ~ ( A @ B )
| ( cQ @ B ) ) ) )
!= ( ! [A: $i] :
( ( cP @ A )
| ( cQ @ A ) ) ) ),
inference(lifteq,[status(thm)],[3]) ).
thf(5,plain,
( ~ ? [A: $i > $o] :
! [B: $i] :
( ( ( A @ B )
| ( cP @ B ) )
& ( ~ ( A @ B )
| ( cQ @ B ) ) )
| ~ ! [A: $i] :
( ( cP @ A )
| ( cQ @ A ) ) ),
inference(bool_ext,[status(thm)],[4]) ).
thf(14,plain,
! [A: $i > $o] :
( ~ ( cQ @ ( sk2 @ A ) )
| ~ ( cP @ ( sk1 @ A ) )
| ~ ( cQ @ ( sk1 @ A ) ) ),
inference(cnf,[status(esa)],[5]) ).
thf(7,plain,
! [A: $i > $o] :
( ~ ( cP @ ( sk2 @ A ) )
| ~ ( cP @ ( sk1 @ A ) )
| ( A @ ( sk1 @ A ) ) ),
inference(cnf,[status(esa)],[5]) ).
thf(37,plain,
( ~ ( cP
@ ( sk2
@ ^ [A: $i] : $false ) )
| ~ ( cP
@ ( sk1
@ ^ [A: $i] : $false ) )
| $false ),
inference(prim_subst,[status(thm)],[7:[bind(A,$thf( ^ [B: $i] : $false ))]]) ).
thf(65,plain,
( ~ ( cP
@ ( sk2
@ ^ [A: $i] : $false ) )
| ~ ( cP
@ ( sk1
@ ^ [A: $i] : $false ) ) ),
inference(simp,[status(thm)],[37]) ).
thf(92,plain,
( ~ ( cP
@ ( sk1
@ ^ [A: $i] : $false ) )
| ( ( cP
@ ( sk2
@ ^ [A: $i] : $false ) )
!= ( cP
@ ( sk1
@ ^ [A: $i] : $false ) ) )
| ~ $true ),
inference(eqfactor_ordered,[status(thm)],[65]) ).
thf(96,plain,
( ~ ( cP
@ ( sk1
@ ^ [A: $i] : $false ) )
| ( ( sk2
@ ^ [A: $i] : $false )
!= ( sk1
@ ^ [A: $i] : $false ) ) ),
inference(simp,[status(thm)],[92]) ).
thf(13,plain,
! [A: $i > $o] :
( ~ ( cP @ ( sk2 @ A ) )
| ~ ( cP @ ( sk1 @ A ) )
| ~ ( cQ @ ( sk1 @ A ) ) ),
inference(cnf,[status(esa)],[5]) ).
thf(29,plain,
! [B: $i > $o,A: $i > $o] :
( ~ ( cP @ ( sk2 @ A ) )
| ~ ( cP @ ( sk1 @ A ) )
| ~ ( cP @ ( sk2 @ B ) )
| ~ ( cP @ ( sk1 @ B ) )
| ( ( A @ ( sk1 @ A ) )
!= ( cQ @ ( sk1 @ B ) ) ) ),
inference(paramod_ordered,[status(thm)],[7,13]) ).
thf(47,plain,
( ~ ( cP @ ( sk2 @ cQ ) )
| ~ ( cP @ ( sk1 @ cQ ) )
| ~ ( cP @ ( sk2 @ cQ ) )
| ~ ( cP @ ( sk1 @ cQ ) ) ),
inference(pre_uni,[status(thm)],[29:[bind(A,$thf( cQ )),bind(B,$thf( cQ ))]]) ).
thf(73,plain,
( ~ ( cP @ ( sk2 @ cQ ) )
| ~ ( cP @ ( sk1 @ cQ ) ) ),
inference(simp,[status(thm)],[47]) ).
thf(6,plain,
( ? [A: $i > $o] :
! [B: $i] :
( ( ( A @ B )
| ( cP @ B ) )
& ( ~ ( A @ B )
| ( cQ @ B ) ) )
| ! [A: $i] :
( ( cP @ A )
| ( cQ @ A ) ) ),
inference(bool_ext,[status(thm)],[4]) ).
thf(15,plain,
! [B: $i,A: $i] :
( ( cP @ B )
| ( cQ @ B )
| ( sk3 @ A )
| ( cP @ A ) ),
inference(cnf,[status(esa)],[6]) ).
thf(183,plain,
$false,
inference(cvc4,[status(thm)],[14,65,96,13,73,7,3,4,15]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : SYO266^5 : TPTP v8.2.0. Released v4.0.0.
% 0.16/0.16 % Command : run_Leo-III %s %d
% 0.16/0.36 % Computer : n028.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 09:34:54 EDT 2024
% 0.16/0.37 % CPUTime :
% 0.96/0.88 % [INFO] Parsing problem /export/starexec/sandbox/benchmark/theBenchmark.p ...
% 1.28/0.98 % [INFO] Parsing done (94ms).
% 1.28/0.98 % [INFO] Running in sequential loop mode.
% 1.65/1.18 % [INFO] eprover registered as external prover.
% 1.65/1.18 % [INFO] cvc4 registered as external prover.
% 1.65/1.19 % [INFO] Scanning for conjecture ...
% 1.65/1.23 % [INFO] Found a conjecture (or negated_conjecture) and 0 axioms. Running axiom selection ...
% 1.81/1.25 % [INFO] Axiom selection finished. Selected 0 axioms (removed 0 axioms).
% 1.81/1.25 % [INFO] Problem is higher-order (TPTP THF).
% 1.81/1.25 % [INFO] Type checking passed.
% 1.81/1.26 % [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 ...
% 5.25/2.15 % External prover 'cvc4' found a proof!
% 5.25/2.15 % [INFO] Killing All external provers ...
% 5.25/2.16 % Time passed: 1614ms (effective reasoning time: 1169ms)
% 5.25/2.16 % 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)>
% 5.25/2.16 % Axioms used in derivation (0):
% 5.25/2.16 % No. of inferences in proof: 18
% 5.25/2.16 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p : 1614 ms resp. 1169 ms w/o parsing
% 5.49/2.18 % SZS output start Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 5.49/2.18 % [INFO] Killing All external provers ...
%------------------------------------------------------------------------------