TSTP Solution File: SEU891^5 by Leo-III-SAT---1.7.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Leo-III-SAT---1.7.12
% Problem : SEU891^5 : TPTP v8.2.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_Leo-III %s %d
% Computer : n016.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 03:44:10 EDT 2024
% Result : Theorem 3.35s 1.89s
% Output : Refutation 3.35s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 9
% Syntax : Number of formulae : 34 ( 7 unt; 8 typ; 0 def)
% Number of atoms : 65 ( 28 equ; 0 cnn)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 119 ( 21 ~; 23 |; 9 &; 63 @)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Number of types : 3 ( 2 usr)
% Number of type conns : 3 ( 3 >; 0 *; 0 +; 0 <<)
% Number of symbols : 9 ( 6 usr; 5 con; 0-2 aty)
% Number of variables : 19 ( 0 ^ 10 !; 9 ?; 19 :)
% Comments :
%------------------------------------------------------------------------------
thf(b_type,type,
b: $tType ).
thf(a_type,type,
a: $tType ).
thf(cF_type,type,
cF: b > a ).
thf(cS_type,type,
cS: b > $o ).
thf(cR_type,type,
cR: b > $o ).
thf(sk1_type,type,
sk1: a ).
thf(sk2_type,type,
sk2: b ).
thf(sk3_type,type,
sk3: b ).
thf(1,conjecture,
! [A: a] :
( ( ? [B: b] :
( ( cR @ B )
& ( A
= ( cF @ B ) ) )
| ? [B: b] :
( ( cS @ B )
& ( A
= ( cF @ B ) ) ) )
=> ? [B: b] :
( ( ( cR @ B )
| ( cS @ B ) )
& ( A
= ( cF @ B ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cTHM34B_pme) ).
thf(2,negated_conjecture,
~ ! [A: a] :
( ( ? [B: b] :
( ( cR @ B )
& ( A
= ( cF @ B ) ) )
| ? [B: b] :
( ( cS @ B )
& ( A
= ( cF @ B ) ) ) )
=> ? [B: b] :
( ( ( cR @ B )
| ( cS @ B ) )
& ( A
= ( cF @ B ) ) ) ),
inference(neg_conjecture,[status(cth)],[1]) ).
thf(3,plain,
~ ! [A: a] :
( ( ? [B: b] :
( ( cR @ B )
& ( A
= ( cF @ B ) ) )
| ? [B: b] :
( ( cS @ B )
& ( A
= ( cF @ B ) ) ) )
=> ? [B: b] :
( ( ( cR @ B )
| ( cS @ B ) )
& ( A
= ( cF @ B ) ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).
thf(5,plain,
( ( sk1
= ( cF @ sk2 ) )
| ( sk1
= ( cF @ sk3 ) ) ),
inference(cnf,[status(esa)],[3]) ).
thf(10,plain,
( ( ( cF @ sk2 )
= sk1 )
| ( ( cF @ sk3 )
= sk1 ) ),
inference(lifteq,[status(thm)],[5]) ).
thf(9,plain,
( ( cR @ sk2 )
| ( cS @ sk3 ) ),
inference(cnf,[status(esa)],[3]) ).
thf(4,plain,
( ( sk1
= ( cF @ sk2 ) )
| ( cS @ sk3 ) ),
inference(cnf,[status(esa)],[3]) ).
thf(14,plain,
( ( ( cF @ sk2 )
= sk1 )
| ( cS @ sk3 ) ),
inference(lifteq,[status(thm)],[4]) ).
thf(7,plain,
! [A: b] :
( ~ ( cR @ A )
| ( sk1
!= ( cF @ A ) ) ),
inference(cnf,[status(esa)],[3]) ).
thf(12,plain,
! [A: b] :
( ( ( cF @ A )
!= sk1 )
| ~ ( cR @ A ) ),
inference(lifteq,[status(thm)],[7]) ).
thf(28,plain,
! [A: b] :
( ( cS @ sk3 )
| ~ ( cR @ A )
| ( ( cF @ sk2 )
!= ( cF @ A ) ) ),
inference(paramod_ordered,[status(thm)],[14,12]) ).
thf(29,plain,
( ( cS @ sk3 )
| ~ ( cR @ sk2 ) ),
inference(pattern_uni,[status(thm)],[28:[bind(A,$thf( sk2 ))]]) ).
thf(44,plain,
( ( cS @ sk3 )
| ( ( cR @ sk2 )
!= ( cR @ sk2 ) ) ),
inference(paramod_ordered,[status(thm)],[9,29]) ).
thf(45,plain,
cS @ sk3,
inference(pattern_uni,[status(thm)],[44:[]]) ).
thf(8,plain,
! [A: b] :
( ~ ( cS @ A )
| ( sk1
!= ( cF @ A ) ) ),
inference(cnf,[status(esa)],[3]) ).
thf(13,plain,
! [A: b] :
( ( ( cF @ A )
!= sk1 )
| ~ ( cS @ A ) ),
inference(lifteq,[status(thm)],[8]) ).
thf(48,plain,
! [A: b] :
( ( ( cF @ A )
!= sk1 )
| ( ( cS @ sk3 )
!= ( cS @ A ) ) ),
inference(paramod_ordered,[status(thm)],[45,13]) ).
thf(49,plain,
( ( cF @ sk3 )
!= sk1 ),
inference(pattern_uni,[status(thm)],[48:[bind(A,$thf( sk3 ))]]) ).
thf(50,plain,
( ( cF @ sk2 )
= sk1 ),
inference(simplifyReflect,[status(thm)],[10,49]) ).
thf(57,plain,
! [A: b] :
( ~ ( cR @ A )
| ( ( cF @ sk2 )
!= ( cF @ A ) ) ),
inference(paramod_ordered,[status(thm)],[50,12]) ).
thf(58,plain,
~ ( cR @ sk2 ),
inference(pattern_uni,[status(thm)],[57:[bind(A,$thf( sk2 ))]]) ).
thf(6,plain,
( ( cR @ sk2 )
| ( sk1
= ( cF @ sk3 ) ) ),
inference(cnf,[status(esa)],[3]) ).
thf(11,plain,
( ( ( cF @ sk3 )
= sk1 )
| ( cR @ sk2 ) ),
inference(lifteq,[status(thm)],[6]) ).
thf(51,plain,
cR @ sk2,
inference(simplifyReflect,[status(thm)],[11,49]) ).
thf(63,plain,
~ $true,
inference(rewrite,[status(thm)],[58,51]) ).
thf(64,plain,
$false,
inference(simp,[status(thm)],[63]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : SEU891^5 : TPTP v8.2.0. Released v4.0.0.
% 0.14/0.15 % Command : run_Leo-III %s %d
% 0.14/0.36 % Computer : n016.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Sun May 19 17:45:39 EDT 2024
% 0.14/0.36 % CPUTime :
% 0.88/0.85 % [INFO] Parsing problem /export/starexec/sandbox2/benchmark/theBenchmark.p ...
% 1.16/0.97 % [INFO] Parsing done (112ms).
% 1.16/0.98 % [INFO] Running in sequential loop mode.
% 1.59/1.25 % [INFO] nitpick registered as external prover.
% 1.59/1.25 % [INFO] Scanning for conjecture ...
% 1.59/1.31 % [INFO] Found a conjecture (or negated_conjecture) and 0 axioms. Running axiom selection ...
% 1.59/1.33 % [INFO] Axiom selection finished. Selected 0 axioms (removed 0 axioms).
% 1.59/1.33 % [INFO] Problem is higher-order (TPTP THF).
% 1.59/1.34 % [INFO] Type checking passed.
% 1.84/1.34 % [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.35/1.89 % [INFO] Killing All external provers ...
% 3.35/1.89 % Time passed: 1405ms (effective reasoning time: 907ms)
% 3.35/1.89 % 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.35/1.89 % Axioms used in derivation (0):
% 3.35/1.89 % No. of inferences in proof: 26
% 3.35/1.89 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p : 1405 ms resp. 907 ms w/o parsing
% 3.35/1.93 % SZS output start Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 3.35/1.93 % [INFO] Killing All external provers ...
%------------------------------------------------------------------------------