TSTP Solution File: LCL726^5 by Leo-III-SAT---1.7.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Leo-III-SAT---1.7.12
% Problem : LCL726^5 : 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 00:11:01 EDT 2024
% Result : Theorem 3.63s 1.86s
% Output : Refutation 3.73s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 5
% Syntax : Number of formulae : 17 ( 4 unt; 3 typ; 0 def)
% Number of atoms : 24 ( 2 equ; 0 cnn)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 106 ( 10 ~; 2 |; 0 &; 78 @)
% ( 0 <=>; 16 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 6 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 68 ( 68 >; 0 *; 0 +; 0 <<)
% Number of symbols : 5 ( 3 usr; 2 con; 0-2 aty)
% Number of variables : 45 ( 0 ^ 29 !; 14 ?; 45 :)
% ( 0 !>; 0 ?*; 0 @-; 2 @+)
% Comments :
%------------------------------------------------------------------------------
thf(a_type,type,
a: $tType ).
thf(sk3_type,type,
sk3: ( ( a > $o ) > a ) > a > $o ).
thf(sk4_type,type,
sk4: ( ( a > $o ) > a ) > a ).
thf(1,conjecture,
( ! [A: ( a > $o ) > $o] :
( ! [B: a > $o] :
( ( A @ B )
=> ? [C: a] : ( B @ C ) )
=> ? [B: ( a > $o ) > a] :
! [C: a > $o] :
( ( A @ C )
=> ( C @ ( B @ C ) ) ) )
=> ! [A: ( ( a > $o ) > a ) > a > $o] :
( ! [B: ( a > $o ) > a] :
? [C: a] : ( A @ B @ C )
=> ? [B: ( a > $o ) > a] : ( A @ B @ ( B @ ( A @ B ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cTHM534) ).
thf(2,negated_conjecture,
~ ( ! [A: ( a > $o ) > $o] :
( ! [B: a > $o] :
( ( A @ B )
=> ? [C: a] : ( B @ C ) )
=> ? [B: ( a > $o ) > a] :
! [C: a > $o] :
( ( A @ C )
=> ( C @ ( B @ C ) ) ) )
=> ! [A: ( ( a > $o ) > a ) > a > $o] :
( ! [B: ( a > $o ) > a] :
? [C: a] : ( A @ B @ C )
=> ? [B: ( a > $o ) > a] : ( A @ B @ ( B @ ( A @ B ) ) ) ) ),
inference(neg_conjecture,[status(cth)],[1]) ).
thf(3,plain,
~ ( ! [A: ( a > $o ) > $o] :
( ! [B: a > $o] :
( ( A @ B )
=> ? [C: a] : ( B @ C ) )
=> ? [B: ( a > $o ) > a] :
! [C: a > $o] :
( ( A @ C )
=> ( C @ ( B @ C ) ) ) )
=> ! [A: ( ( a > $o ) > a ) > a > $o] :
( ! [B: ( a > $o ) > a] :
? [C: a] : ( A @ B @ C )
=> ? [B: ( a > $o ) > a] : ( A @ B @ ( B @ ( A @ B ) ) ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).
thf(5,plain,
! [A: ( a > $o ) > a] : ( sk3 @ A @ ( sk4 @ A ) ),
inference(cnf,[status(esa)],[3]) ).
thf(9,plain,
! [A: ( a > $o ) > a] : ( sk3 @ A @ ( sk4 @ A ) ),
inference(simp,[status(thm)],[5]) ).
thf(12,axiom,
? [A: ( a > $o ) > a] :
! [B: a > $o] :
( ? [C: a] : ( B @ C )
=> ( B @ ( A @ B ) ) ),
introduced(axiom_of_choice) ).
thf(13,plain,
! [B: a,A: ( a > $o ) > a] :
( ~ ( sk3 @ A @ B )
| ( sk3 @ A
@ @+[C: a] : ( sk3 @ A @ C ) ) ),
inference(choice,[status(esa)],[12]) ).
thf(4,plain,
! [A: ( a > $o ) > a] :
~ ( sk3 @ A @ ( A @ ( sk3 @ A ) ) ),
inference(cnf,[status(esa)],[3]) ).
thf(8,plain,
! [A: ( a > $o ) > a] :
~ ( sk3 @ A @ ( A @ ( sk3 @ A ) ) ),
inference(simp,[status(thm)],[4]) ).
thf(16,plain,
! [C: ( a > $o ) > a,B: a,A: ( a > $o ) > a] :
( ~ ( sk3 @ A @ B )
| ( ( sk3 @ A
@ @+[D: a] : ( sk3 @ A @ D ) )
!= ( sk3 @ C @ ( C @ ( sk3 @ C ) ) ) ) ),
inference(paramod_ordered,[status(thm)],[13,8]) ).
thf(21,plain,
! [A: a] :
~ ( sk3 @ ( '@+' @ a ) @ A ),
inference(pre_uni,[status(thm)],[16:[bind(A,$thf( '@+' @ a )),bind(B,$thf( B )),bind(C,$thf( '@+' @ a ))]]) ).
thf(23,plain,
! [A: a] :
~ ( sk3 @ ( '@+' @ a ) @ A ),
inference(simp,[status(thm)],[21]) ).
thf(24,plain,
! [B: a,A: ( a > $o ) > a] :
( ( sk3 @ A @ ( sk4 @ A ) )
!= ( sk3 @ ( '@+' @ a ) @ B ) ),
inference(paramod_ordered,[status(thm)],[9,23]) ).
thf(25,plain,
$false,
inference(pattern_uni,[status(thm)],[24:[bind(A,$thf( '@+' @ a )),bind(B,$thf( sk4 @ ( '@+' @ a ) ))]]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13 % Problem : LCL726^5 : TPTP v8.2.0. Released v4.0.0.
% 0.13/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:45:39 EDT 2024
% 0.16/0.37 % CPUTime :
% 1.02/0.88 % [INFO] Parsing problem /export/starexec/sandbox/benchmark/theBenchmark.p ...
% 1.23/0.99 % [INFO] Parsing done (108ms).
% 1.23/1.00 % [INFO] Running in sequential loop mode.
% 1.66/1.22 % [INFO] nitpick registered as external prover.
% 1.66/1.22 % [INFO] Scanning for conjecture ...
% 1.79/1.28 % [INFO] Found a conjecture (or negated_conjecture) and 0 axioms. Running axiom selection ...
% 1.79/1.30 % [INFO] Axiom selection finished. Selected 0 axioms (removed 0 axioms).
% 1.79/1.30 % [INFO] Problem is higher-order (TPTP THF).
% 1.79/1.30 % [INFO] Type checking passed.
% 1.79/1.30 % [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.63/1.85 % [INFO] Killing All external provers ...
% 3.63/1.86 % Time passed: 1311ms (effective reasoning time: 852ms)
% 3.63/1.86 % 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.63/1.86 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p : 1311 ms resp. 852 ms w/o parsing
% 3.73/1.92 % SZS output start Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 3.73/1.92 % [INFO] Killing All external provers ...
%------------------------------------------------------------------------------