TSTP Solution File: SEV417^5 by Leo-III-SAT---1.7.15
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Leo-III-SAT---1.7.15
% Problem : SEV417^5 : TPTP v8.2.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_Leo-III %s %d SAT
% 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 : Mon Jun 24 16:00:12 EDT 2024
% Result : Theorem 2.65s 1.62s
% Output : Refutation 2.86s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 1
% Syntax : Number of formulae : 26 ( 9 unt; 0 typ; 0 def)
% Number of atoms : 86 ( 17 equ; 0 cnn)
% Maximal formula atoms : 5 ( 3 avg)
% Number of connectives : 147 ( 24 ~; 10 |; 28 &; 73 @)
% ( 0 <=>; 12 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 5 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 12 ( 12 >; 0 *; 0 +; 0 <<)
% Number of symbols : 8 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 60 ( 32 ^ 26 !; 2 ?; 60 :)
% Comments :
%------------------------------------------------------------------------------
thf(a_type,type,
a: $tType ).
thf(cP_type,type,
cP: ( a > $o ) > $o ).
thf(sk1_type,type,
sk1: a > $o ).
thf(sk2_type,type,
sk2: a > $o ).
thf(sk3_type,type,
sk3: a > $o ).
thf(sk4_type,type,
sk4: a ).
thf(1,conjecture,
! [A: a > $o,B: a > $o,C: a > $o] :
( ( ! [D: a] :
( ( A @ D )
=> ( B @ D ) )
& ! [D: a] :
( ( A @ D )
=> ( C @ D ) )
& ( ( ^ [D: a] :
( ( B @ D )
& ( C @ D ) ) )
= ( ^ [D: a] : $false ) )
& ( cP
@ ^ [D: a] :
( ( B @ D )
& ( C @ D ) ) ) )
=> ( ( A
= ( ^ [D: a] : $false ) )
& ( cP
@ ^ [D: a] : $false ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cTHM502_pme) ).
thf(2,negated_conjecture,
~ ! [A: a > $o,B: a > $o,C: a > $o] :
( ( ! [D: a] :
( ( A @ D )
=> ( B @ D ) )
& ! [D: a] :
( ( A @ D )
=> ( C @ D ) )
& ( ( ^ [D: a] :
( ( B @ D )
& ( C @ D ) ) )
= ( ^ [D: a] : $false ) )
& ( cP
@ ^ [D: a] :
( ( B @ D )
& ( C @ D ) ) ) )
=> ( ( A
= ( ^ [D: a] : $false ) )
& ( cP
@ ^ [D: a] : $false ) ) ),
inference(neg_conjecture,[status(cth)],[1]) ).
thf(3,plain,
~ ! [A: a > $o,B: a > $o,C: a > $o] :
( ( ! [D: a] :
( ( A @ D )
=> ( B @ D ) )
& ! [D: a] :
( ( A @ D )
=> ( C @ D ) )
& ( ( ^ [D: a] :
( ( B @ D )
& ( C @ D ) ) )
= ( ^ [D: a] : $false ) )
& ( cP
@ ^ [D: a] :
( ( B @ D )
& ( C @ D ) ) ) )
=> ( ( A
= ( ^ [D: a] : $false ) )
& ( cP
@ ^ [D: a] : $false ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).
thf(4,plain,
~ ! [A: a > $o] :
( ? [B: a > $o] :
( ! [C: a] :
( ( A @ C )
=> ( B @ C ) )
& ? [C: a > $o] :
( ! [D: a] :
( ( A @ D )
=> ( C @ D ) )
& ( ( ^ [D: a] :
( ( B @ D )
& ( C @ D ) ) )
= ( ^ [D: a] : $false ) )
& ( cP
@ ^ [D: a] :
( ( B @ D )
& ( C @ D ) ) ) ) )
=> ( ( A
= ( ^ [B: a] : $false ) )
& ( cP
@ ^ [B: a] : $false ) ) ),
inference(miniscope,[status(thm)],[3]) ).
thf(8,plain,
! [A: a] :
( ~ ( sk1 @ A )
| ( sk3 @ A ) ),
inference(cnf,[status(esa)],[4]) ).
thf(12,plain,
! [A: a] :
( ~ ( sk1 @ A )
| ( sk3 @ A ) ),
inference(simp,[status(thm)],[8]) ).
thf(6,plain,
( ( sk1
!= ( ^ [A: a] : $false ) )
| ~ ( cP
@ ^ [A: a] : $false ) ),
inference(cnf,[status(esa)],[4]) ).
thf(10,plain,
( ( sk1
!= ( ^ [A: a] : $false ) )
| ~ ( cP
@ ^ [A: a] : $false ) ),
inference(lifteq,[status(thm)],[6]) ).
thf(5,plain,
( cP
@ ^ [A: a] :
( ( sk2 @ A )
& ( sk3 @ A ) ) ),
inference(cnf,[status(esa)],[4]) ).
thf(9,plain,
( ( ^ [A: a] :
( ( sk2 @ A )
& ( sk3 @ A ) ) )
= ( ^ [A: a] : $false ) ),
inference(cnf,[status(esa)],[4]) ).
thf(11,plain,
( ( ^ [A: a] :
( ( sk2 @ A )
& ( sk3 @ A ) ) )
= ( ^ [A: a] : $false ) ),
inference(lifteq,[status(thm)],[9]) ).
thf(13,plain,
( cP
@ ^ [A: a] : $false ),
inference(rewrite,[status(thm)],[5,11]) ).
thf(16,plain,
( ( sk1
!= ( ^ [A: a] : $false ) )
| ~ $true ),
inference(rewrite,[status(thm)],[10,13]) ).
thf(17,plain,
( sk1
!= ( ^ [A: a] : $false ) ),
inference(simp,[status(thm)],[16]) ).
thf(18,plain,
sk1 @ sk4,
inference(func_ext,[status(esa)],[17]) ).
thf(7,plain,
! [A: a] :
( ~ ( sk1 @ A )
| ( sk2 @ A ) ),
inference(cnf,[status(esa)],[4]) ).
thf(21,plain,
! [A: a] :
( ( sk2 @ A )
| ( ( sk1 @ sk4 )
!= ( sk1 @ A ) ) ),
inference(paramod_ordered,[status(thm)],[18,7]) ).
thf(22,plain,
sk2 @ sk4,
inference(pattern_uni,[status(thm)],[21:[bind(A,$thf( sk4 ))]]) ).
thf(14,plain,
! [A: a] :
~ ( ( sk2 @ A )
& ( sk3 @ A ) ),
inference(func_ext,[status(esa)],[11]) ).
thf(15,plain,
! [A: a] :
( ~ ( sk2 @ A )
| ~ ( sk3 @ A ) ),
inference(cnf,[status(esa)],[14]) ).
thf(23,plain,
! [A: a] :
( ~ ( sk3 @ A )
| ( ( sk2 @ sk4 )
!= ( sk2 @ A ) ) ),
inference(paramod_ordered,[status(thm)],[22,15]) ).
thf(24,plain,
~ ( sk3 @ sk4 ),
inference(pattern_uni,[status(thm)],[23:[bind(A,$thf( sk4 ))]]) ).
thf(25,plain,
! [A: a] :
( ~ ( sk1 @ A )
| ( ( sk3 @ A )
!= ( sk3 @ sk4 ) ) ),
inference(paramod_ordered,[status(thm)],[12,24]) ).
thf(26,plain,
~ ( sk1 @ sk4 ),
inference(pattern_uni,[status(thm)],[25:[bind(A,$thf( sk4 ))]]) ).
thf(31,plain,
~ $true,
inference(rewrite,[status(thm)],[26,18]) ).
thf(32,plain,
$false,
inference(simp,[status(thm)],[31]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : SEV417^5 : TPTP v8.2.0. Released v4.0.0.
% 0.06/0.11 % Command : run_Leo-III %s %d SAT
% 0.11/0.32 % Computer : n028.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 : Fri Jun 21 19:36:40 EDT 2024
% 0.11/0.32 % CPUTime :
% 0.96/0.85 % [INFO] Parsing problem /export/starexec/sandbox2/benchmark/theBenchmark.p ...
% 1.16/0.95 % [INFO] Parsing done (99ms).
% 1.16/0.96 % [INFO] Running in sequential loop mode.
% 1.51/1.16 % [INFO] nitpick registered as external prover.
% 1.60/1.16 % [INFO] Scanning for conjecture ...
% 1.60/1.22 % [INFO] Found a conjecture (or negated_conjecture) and 0 axioms. Running axiom selection ...
% 1.80/1.24 % [INFO] Axiom selection finished. Selected 0 axioms (removed 0 axioms).
% 1.80/1.24 % [INFO] Problem is higher-order (TPTP THF).
% 1.80/1.24 % [INFO] Type checking passed.
% 1.80/1.24 % [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.65/1.62 % [INFO] Killing All external provers ...
% 2.65/1.62 % Time passed: 1100ms (effective reasoning time: 656ms)
% 2.65/1.62 % 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.65/1.62 % Axioms used in derivation (0):
% 2.65/1.62 % No. of inferences in proof: 26
% 2.65/1.62 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p : 1100 ms resp. 656 ms w/o parsing
% 2.86/1.66 % SZS output start Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 2.86/1.66 % [INFO] Killing All external provers ...
%------------------------------------------------------------------------------