TSTP Solution File: SYN382^5 by Leo-III-SAT---1.7.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Leo-III-SAT---1.7.12
% Problem : SYN382^5 : TPTP v8.2.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_Leo-III %s %d
% Computer : n010.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:18:19 EDT 2024
% Result : Theorem 2.45s 1.49s
% Output : Refutation 2.50s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 6
% Syntax : Number of formulae : 19 ( 8 unt; 5 typ; 0 def)
% Number of atoms : 32 ( 2 equ; 0 cnn)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 86 ( 9 ~; 10 |; 0 &; 63 @)
% ( 0 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 6 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 5 ( 5 >; 0 *; 0 +; 0 <<)
% Number of symbols : 7 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 35 ( 0 ^ 25 !; 10 ?; 35 :)
% Comments :
%------------------------------------------------------------------------------
thf(cQ_type,type,
cQ: $i > $i > $o ).
thf(cP_type,type,
cP: $i > $i > $o ).
thf(sk1_type,type,
sk1: $i ).
thf(sk2_type,type,
sk2: $i > $i ).
thf(sk3_type,type,
sk3: $i ).
thf(1,conjecture,
( ! [A: $i] :
? [B: $i] :
( ! [C: $i] : ( cP @ B @ C )
| ( cQ @ B @ A ) )
=> ! [A: $i] :
? [B: $i] :
( ( cP @ B @ A )
| ( cQ @ B @ A ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cX2134) ).
thf(2,negated_conjecture,
~ ( ! [A: $i] :
? [B: $i] :
( ! [C: $i] : ( cP @ B @ C )
| ( cQ @ B @ A ) )
=> ! [A: $i] :
? [B: $i] :
( ( cP @ B @ A )
| ( cQ @ B @ A ) ) ),
inference(neg_conjecture,[status(cth)],[1]) ).
thf(3,plain,
~ ( ! [A: $i] :
? [B: $i] :
( ! [C: $i] : ( cP @ B @ C )
| ( cQ @ B @ A ) )
=> ! [A: $i] :
? [B: $i] :
( ( cP @ B @ A )
| ( cQ @ B @ A ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).
thf(4,plain,
~ ( ( ? [A: $i] :
! [B: $i] : ( cP @ A @ B )
| ! [A: $i] :
? [B: $i] : ( cQ @ B @ A ) )
=> ! [A: $i] :
( ? [B: $i] : ( cP @ B @ A )
| ? [B: $i] : ( cQ @ B @ A ) ) ),
inference(miniscope,[status(thm)],[3]) ).
thf(7,plain,
! [B: $i,A: $i] :
( ( cP @ sk1 @ A )
| ( cQ @ ( sk2 @ B ) @ B ) ),
inference(cnf,[status(esa)],[4]) ).
thf(6,plain,
! [A: $i] :
~ ( cP @ A @ sk3 ),
inference(cnf,[status(esa)],[4]) ).
thf(9,plain,
! [A: $i] :
~ ( cP @ A @ sk3 ),
inference(simp,[status(thm)],[6]) ).
thf(11,plain,
! [C: $i,B: $i,A: $i] :
( ( cQ @ ( sk2 @ B ) @ B )
| ( ( cP @ sk1 @ A )
!= ( cP @ C @ sk3 ) ) ),
inference(paramod_ordered,[status(thm)],[7,9]) ).
thf(12,plain,
! [A: $i] : ( cQ @ ( sk2 @ A ) @ A ),
inference(pattern_uni,[status(thm)],[11:[bind(A,$thf( sk3 )),bind(B,$thf( B )),bind(C,$thf( sk1 ))]]) ).
thf(13,plain,
! [A: $i] : ( cQ @ ( sk2 @ A ) @ A ),
inference(simp,[status(thm)],[12]) ).
thf(5,plain,
! [A: $i] :
~ ( cQ @ A @ sk3 ),
inference(cnf,[status(esa)],[4]) ).
thf(8,plain,
! [A: $i] :
~ ( cQ @ A @ sk3 ),
inference(simp,[status(thm)],[5]) ).
thf(14,plain,
! [B: $i,A: $i] :
( ( cQ @ ( sk2 @ A ) @ A )
!= ( cQ @ B @ sk3 ) ),
inference(paramod_ordered,[status(thm)],[13,8]) ).
thf(15,plain,
$false,
inference(pattern_uni,[status(thm)],[14:[bind(A,$thf( sk3 )),bind(B,$thf( sk2 @ sk3 ))]]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SYN382^5 : TPTP v8.2.0. Released v4.0.0.
% 0.07/0.16 % Command : run_Leo-III %s %d
% 0.17/0.37 % Computer : n010.cluster.edu
% 0.17/0.37 % Model : x86_64 x86_64
% 0.17/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.37 % Memory : 8042.1875MB
% 0.17/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.17/0.37 % CPULimit : 300
% 0.17/0.37 % WCLimit : 300
% 0.17/0.37 % DateTime : Mon May 20 14:33:09 EDT 2024
% 0.17/0.37 % CPUTime :
% 0.95/0.86 % [INFO] Parsing problem /export/starexec/sandbox2/benchmark/theBenchmark.p ...
% 1.05/0.95 % [INFO] Parsing done (90ms).
% 1.23/0.96 % [INFO] Running in sequential loop mode.
% 1.56/1.15 % [INFO] nitpick registered as external prover.
% 1.56/1.16 % [INFO] Scanning for conjecture ...
% 1.56/1.20 % [INFO] Found a conjecture (or negated_conjecture) and 0 axioms. Running axiom selection ...
% 1.56/1.22 % [INFO] Axiom selection finished. Selected 0 axioms (removed 0 axioms).
% 1.56/1.22 % [INFO] Problem is higher-order (TPTP THF).
% 1.56/1.22 % [INFO] Type checking passed.
% 1.56/1.23 % [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.45/1.48 % [INFO] Killing All external provers ...
% 2.45/1.49 % Time passed: 951ms (effective reasoning time: 521ms)
% 2.45/1.49 % 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.45/1.49 % Axioms used in derivation (0):
% 2.45/1.49 % No. of inferences in proof: 14
% 2.45/1.49 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p : 951 ms resp. 521 ms w/o parsing
% 2.50/1.55 % SZS output start Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 2.50/1.55 % [INFO] Killing All external provers ...
%------------------------------------------------------------------------------