TSTP Solution File: SEU853^5 by Leo-III-SAT---1.7.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Leo-III-SAT---1.7.12
% Problem : SEU853^5 : TPTP v8.2.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_Leo-III %s %d
% Computer : n024.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:05 EDT 2024
% Result : Theorem 3.85s 2.27s
% Output : Refutation 3.85s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 6
% Syntax : Number of formulae : 24 ( 13 unt; 5 typ; 0 def)
% Number of atoms : 70 ( 10 equ; 0 cnn)
% Maximal formula atoms : 7 ( 3 avg)
% Number of connectives : 188 ( 37 ~; 5 |; 32 &; 87 @)
% ( 0 <=>; 27 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 4 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 12 ( 12 >; 0 *; 0 +; 0 <<)
% Number of symbols : 7 ( 4 usr; 3 con; 0-2 aty)
% Number of variables : 29 ( 2 ^ 27 !; 0 ?; 29 :)
% Comments :
%------------------------------------------------------------------------------
thf(a_type,type,
a: $tType ).
thf(sk1_type,type,
sk1: a > $o ).
thf(sk2_type,type,
sk2: a > $o ).
thf(sk3_type,type,
sk3: a > $o ).
thf(sk6_type,type,
sk6: a ).
thf(1,conjecture,
! [A: a > $o,B: a > $o,C: a > $o] :
( ( ! [D: a] :
( ( A @ D )
=> ( C @ D ) )
& ! [D: a] :
( ( B @ D )
=> ( C @ D ) ) )
=> ( ( ! [D: a] :
( ( A @ D )
=> ( B @ D ) ) )
= ( ! [D: a] :
( ( ( A @ D )
& ( C @ D )
& ~ ( B @ D ) )
=> ( ( C @ D )
& ~ ( A @ D ) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cGAZING_THM35_pme) ).
thf(2,negated_conjecture,
~ ! [A: a > $o,B: a > $o,C: a > $o] :
( ( ! [D: a] :
( ( A @ D )
=> ( C @ D ) )
& ! [D: a] :
( ( B @ D )
=> ( C @ D ) ) )
=> ( ( ! [D: a] :
( ( A @ D )
=> ( B @ D ) ) )
= ( ! [D: a] :
( ( ( A @ D )
& ( C @ D )
& ~ ( B @ D ) )
=> ( ( C @ D )
& ~ ( A @ D ) ) ) ) ) ),
inference(neg_conjecture,[status(cth)],[1]) ).
thf(3,plain,
~ ! [A: a > $o,B: a > $o,C: a > $o] :
( ( ! [D: a] :
( ( A @ D )
=> ( C @ D ) )
& ! [D: a] :
( ( B @ D )
=> ( C @ D ) ) )
=> ( ( ! [D: a] :
( ( A @ D )
=> ( B @ D ) ) )
= ( ! [D: a] :
( ( ( A @ D )
& ( C @ D )
& ~ ( B @ D ) )
=> ( ( C @ D )
& ~ ( A @ D ) ) ) ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).
thf(4,plain,
( ( ! [A: a] :
( ( sk1 @ A )
=> ( sk2 @ A ) ) )
!= ( ! [A: a] :
( ( ( sk1 @ A )
& ( sk3 @ A )
& ~ ( sk2 @ A ) )
=> ( ( sk3 @ A )
& ~ ( sk1 @ A ) ) ) ) ),
inference(cnf,[status(esa)],[3]) ).
thf(7,plain,
( ( ! [A: a] :
( ( ( sk1 @ A )
& ( sk3 @ A )
& ~ ( sk2 @ A ) )
=> ( ( sk3 @ A )
& ~ ( sk1 @ A ) ) ) )
!= ( ! [A: a] :
( ( sk1 @ A )
=> ( sk2 @ A ) ) ) ),
inference(lifteq,[status(thm)],[4]) ).
thf(9,plain,
( ( ^ [A: a] :
( ( ( sk1 @ A )
& ( sk3 @ A )
& ~ ( sk2 @ A ) )
=> ( ( sk3 @ A )
& ~ ( sk1 @ A ) ) ) )
!= ( ^ [A: a] :
( ( sk1 @ A )
=> ( sk2 @ A ) ) ) ),
inference(simp,[status(thm)],[7]) ).
thf(24,plain,
( ( ( ( sk1 @ sk6 )
& ( sk3 @ sk6 )
& ~ ( sk2 @ sk6 ) )
=> ( ( sk3 @ sk6 )
& ~ ( sk1 @ sk6 ) ) )
!= ( ( sk1 @ sk6 )
=> ( sk2 @ sk6 ) ) ),
inference(func_ext,[status(esa)],[9]) ).
thf(26,plain,
( ~ ( ( ( sk1 @ sk6 )
& ( sk3 @ sk6 )
& ~ ( sk2 @ sk6 ) )
=> ( ( sk3 @ sk6 )
& ~ ( sk1 @ sk6 ) ) )
| ~ ( ( sk1 @ sk6 )
=> ( sk2 @ sk6 ) ) ),
inference(bool_ext,[status(thm)],[24]) ).
thf(28,plain,
( ( sk1 @ sk6 )
| ( sk1 @ sk6 ) ),
inference(cnf,[status(esa)],[26]) ).
thf(36,plain,
sk1 @ sk6,
inference(simp,[status(thm)],[28]) ).
thf(42,plain,
( ( ( $true
& ( sk3 @ sk6 )
& ~ ( sk2 @ sk6 ) )
=> ( ( sk3 @ sk6 )
& ~ $true ) )
!= ( $true
=> ( sk2 @ sk6 ) ) ),
inference(rewrite,[status(thm)],[24,36]) ).
thf(43,plain,
( ( ~ ( ( sk3 @ sk6 )
& ~ ( sk2 @ sk6 ) ) )
!= ( sk2 @ sk6 ) ),
inference(simp,[status(thm)],[42]) ).
thf(6,plain,
! [A: a] :
( ~ ( sk1 @ A )
| ( sk3 @ A ) ),
inference(cnf,[status(esa)],[3]) ).
thf(47,plain,
! [A: a] :
( ( sk3 @ A )
| ( ( sk1 @ sk6 )
!= ( sk1 @ A ) ) ),
inference(paramod_ordered,[status(thm)],[36,6]) ).
thf(48,plain,
sk3 @ sk6,
inference(pattern_uni,[status(thm)],[47:[bind(A,$thf( sk6 ))]]) ).
thf(33,plain,
( ~ ( sk2 @ sk6 )
| ~ ( sk2 @ sk6 ) ),
inference(cnf,[status(esa)],[26]) ).
thf(37,plain,
~ ( sk2 @ sk6 ),
inference(simp,[status(thm)],[33]) ).
thf(49,plain,
~ ( $true
& ~ $false ),
inference(rewrite,[status(thm)],[43,48,37]) ).
thf(50,plain,
$false,
inference(simp,[status(thm)],[49]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.09 % Problem : SEU853^5 : TPTP v8.2.0. Released v4.0.0.
% 0.08/0.12 % Command : run_Leo-III %s %d
% 0.11/0.32 % Computer : n024.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 300
% 0.11/0.32 % WCLimit : 300
% 0.11/0.32 % DateTime : Sun May 19 16:36:53 EDT 2024
% 0.11/0.32 % CPUTime :
% 0.89/0.93 % [INFO] Parsing problem /export/starexec/sandbox2/benchmark/theBenchmark.p ...
% 1.29/1.10 % [INFO] Parsing done (160ms).
% 1.29/1.11 % [INFO] Running in sequential loop mode.
% 1.86/1.47 % [INFO] nitpick registered as external prover.
% 1.86/1.47 % [INFO] Scanning for conjecture ...
% 2.02/1.56 % [INFO] Found a conjecture (or negated_conjecture) and 0 axioms. Running axiom selection ...
% 2.08/1.59 % [INFO] Axiom selection finished. Selected 0 axioms (removed 0 axioms).
% 2.08/1.59 % [INFO] Problem is higher-order (TPTP THF).
% 2.08/1.60 % [INFO] Type checking passed.
% 2.08/1.60 % [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.85/2.26 % [INFO] Killing All external provers ...
% 3.85/2.27 % Time passed: 1800ms (effective reasoning time: 1152ms)
% 3.85/2.27 % 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.85/2.27 % Axioms used in derivation (0):
% 3.85/2.27 % No. of inferences in proof: 19
% 3.85/2.27 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p : 1800 ms resp. 1152 ms w/o parsing
% 3.85/2.32 % SZS output start Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 3.85/2.32 % [INFO] Killing All external provers ...
%------------------------------------------------------------------------------