TSTP Solution File: SEV196^5 by Leo-III-SAT---1.7.15
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Leo-III-SAT---1.7.15
% Problem : SEV196^5 : TPTP v8.2.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_Leo-III %s %d SAT
% Computer : n029.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 15:59:44 EDT 2024
% Result : Theorem 3.51s 1.83s
% Output : Refutation 3.51s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 1
% Syntax : Number of formulae : 18 ( 4 unt; 0 typ; 0 def)
% Number of atoms : 70 ( 43 equ; 0 cnn)
% Maximal formula atoms : 8 ( 3 avg)
% Number of connectives : 295 ( 31 ~; 32 |; 26 &; 198 @)
% ( 0 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 24 ( 12 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 12 ( 12 >; 0 *; 0 +; 0 <<)
% Number of symbols : 8 ( 5 usr; 5 con; 0-3 aty)
% Number of variables : 84 ( 0 ^ 60 !; 24 ?; 84 :)
% Comments :
%------------------------------------------------------------------------------
thf(a_type,type,
a: $tType ).
thf(y_type,type,
y: a ).
thf(x_type,type,
x: a ).
thf(cP_type,type,
cP: a > a > a ).
thf(c0_type,type,
c0: a ).
thf(sk1_type,type,
sk1: a > a > a > $o ).
thf(1,conjecture,
! [A: a > a > a > $o] :
( ( $true
& ! [B: a,C: a,D: a] :
( ( ( ( B = c0 )
& ( C = D ) )
| ( ( C = c0 )
& ( B = D ) )
| ? [E: a,F: a,G: a,H: a,I: a,J: a] :
( ( B
= ( cP @ E @ F ) )
& ( C
= ( cP @ G @ H ) )
& ( D
= ( cP @ I @ J ) )
& ( A @ E @ G @ I )
& ( A @ F @ H @ J ) ) )
=> ( A @ B @ C @ D ) ) )
=> ( A @ ( cP @ x @ c0 ) @ ( cP @ c0 @ y ) @ ( cP @ x @ y ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cS_JOIN_LEM2_pme) ).
thf(2,negated_conjecture,
~ ! [A: a > a > a > $o] :
( ( $true
& ! [B: a,C: a,D: a] :
( ( ( ( B = c0 )
& ( C = D ) )
| ( ( C = c0 )
& ( B = D ) )
| ? [E: a,F: a,G: a,H: a,I: a,J: a] :
( ( B
= ( cP @ E @ F ) )
& ( C
= ( cP @ G @ H ) )
& ( D
= ( cP @ I @ J ) )
& ( A @ E @ G @ I )
& ( A @ F @ H @ J ) ) )
=> ( A @ B @ C @ D ) ) )
=> ( A @ ( cP @ x @ c0 ) @ ( cP @ c0 @ y ) @ ( cP @ x @ y ) ) ),
inference(neg_conjecture,[status(cth)],[1]) ).
thf(3,plain,
~ ! [A: a > a > a > $o] :
( ! [B: a,C: a,D: a] :
( ( ( ( B = c0 )
& ( C = D ) )
| ( ( C = c0 )
& ( B = D ) )
| ? [E: a,F: a,G: a,H: a,I: a,J: a] :
( ( B
= ( cP @ E @ F ) )
& ( C
= ( cP @ G @ H ) )
& ( D
= ( cP @ I @ J ) )
& ( A @ E @ G @ I )
& ( A @ F @ H @ J ) ) )
=> ( A @ B @ C @ D ) )
=> ( A @ ( cP @ x @ c0 ) @ ( cP @ c0 @ y ) @ ( cP @ x @ y ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).
thf(4,plain,
~ ! [A: a > a > a > $o] :
( ! [B: a,C: a,D: a] :
( ( ( ( B = c0 )
& ( C = D ) )
| ( ( C = c0 )
& ( B = D ) )
| ? [E: a,F: a] :
( ( B
= ( cP @ E @ F ) )
& ? [G: a,H: a] :
( ( C
= ( cP @ G @ H ) )
& ? [I: a,J: a] :
( ( D
= ( cP @ I @ J ) )
& ( A @ E @ G @ I )
& ( A @ F @ H @ J ) ) ) ) )
=> ( A @ B @ C @ D ) )
=> ( A @ ( cP @ x @ c0 ) @ ( cP @ c0 @ y ) @ ( cP @ x @ y ) ) ),
inference(miniscope,[status(thm)],[3]) ).
thf(8,plain,
! [I: a,H: a,G: a,F: a,E: a,D: a,C: a,B: a,A: a] :
( ( A
!= ( cP @ D @ E ) )
| ( B
!= ( cP @ F @ G ) )
| ( C
!= ( cP @ H @ I ) )
| ~ ( sk1 @ D @ F @ H )
| ~ ( sk1 @ E @ G @ I )
| ( sk1 @ A @ B @ C ) ),
inference(cnf,[status(esa)],[4]) ).
thf(13,plain,
! [I: a,H: a,G: a,F: a,E: a,D: a,C: a,B: a,A: a] :
( ( A
!= ( cP @ D @ E ) )
| ( B
!= ( cP @ F @ G ) )
| ( C
!= ( cP @ H @ I ) )
| ~ ( sk1 @ D @ F @ H )
| ~ ( sk1 @ E @ G @ I )
| ( sk1 @ A @ B @ C ) ),
inference(lifteq,[status(thm)],[8]) ).
thf(14,plain,
! [F: a,E: a,D: a,C: a,B: a,A: a] :
( ~ ( sk1 @ A @ C @ E )
| ~ ( sk1 @ B @ D @ F )
| ( sk1 @ ( cP @ A @ B ) @ ( cP @ C @ D ) @ ( cP @ E @ F ) ) ),
inference(simp,[status(thm)],[13]) ).
thf(5,plain,
~ ( sk1 @ ( cP @ x @ c0 ) @ ( cP @ c0 @ y ) @ ( cP @ x @ y ) ),
inference(cnf,[status(esa)],[4]) ).
thf(25,plain,
! [F: a,E: a,D: a,C: a,B: a,A: a] :
( ~ ( sk1 @ A @ C @ E )
| ~ ( sk1 @ B @ D @ F )
| ( ( sk1 @ ( cP @ A @ B ) @ ( cP @ C @ D ) @ ( cP @ E @ F ) )
!= ( sk1 @ ( cP @ x @ c0 ) @ ( cP @ c0 @ y ) @ ( cP @ x @ y ) ) ) ),
inference(paramod_ordered,[status(thm)],[14,5]) ).
thf(26,plain,
( ~ ( sk1 @ x @ c0 @ x )
| ~ ( sk1 @ c0 @ y @ y ) ),
inference(pattern_uni,[status(thm)],[25:[bind(A,$thf( x )),bind(B,$thf( c0 )),bind(C,$thf( c0 )),bind(D,$thf( y )),bind(E,$thf( x )),bind(F,$thf( y ))]]) ).
thf(6,plain,
! [C: a,B: a,A: a] :
( ( A != c0 )
| ( B != C )
| ( sk1 @ A @ B @ C ) ),
inference(cnf,[status(esa)],[4]) ).
thf(9,plain,
! [C: a,B: a,A: a] :
( ( A != c0 )
| ( B != C )
| ( sk1 @ A @ B @ C ) ),
inference(lifteq,[status(thm)],[6]) ).
thf(10,plain,
! [A: a] : ( sk1 @ c0 @ A @ A ),
inference(simp,[status(thm)],[9]) ).
thf(7,plain,
! [C: a,B: a,A: a] :
( ( B != c0 )
| ( A != C )
| ( sk1 @ A @ B @ C ) ),
inference(cnf,[status(esa)],[4]) ).
thf(11,plain,
! [C: a,B: a,A: a] :
( ( B != c0 )
| ( A != C )
| ( sk1 @ A @ B @ C ) ),
inference(lifteq,[status(thm)],[7]) ).
thf(12,plain,
! [A: a] : ( sk1 @ A @ c0 @ A ),
inference(simp,[status(thm)],[11]) ).
thf(45,plain,
( ~ $true
| ~ $true ),
inference(rewrite,[status(thm)],[26,10,12]) ).
thf(46,plain,
$false,
inference(simp,[status(thm)],[45]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : SEV196^5 : TPTP v8.2.0. Released v4.0.0.
% 0.12/0.12 % Command : run_Leo-III %s %d SAT
% 0.12/0.33 % Computer : n029.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Fri Jun 21 19:00:10 EDT 2024
% 0.12/0.34 % CPUTime :
% 0.99/0.87 % [INFO] Parsing problem /export/starexec/sandbox2/benchmark/theBenchmark.p ...
% 1.17/0.97 % [INFO] Parsing done (97ms).
% 1.17/0.97 % [INFO] Running in sequential loop mode.
% 1.47/1.17 % [INFO] nitpick registered as external prover.
% 1.63/1.18 % [INFO] Scanning for conjecture ...
% 1.83/1.24 % [INFO] Found a conjecture (or negated_conjecture) and 0 axioms. Running axiom selection ...
% 1.83/1.27 % [INFO] Axiom selection finished. Selected 0 axioms (removed 0 axioms).
% 1.83/1.27 % [INFO] Problem is higher-order (TPTP THF).
% 1.83/1.27 % [INFO] Type checking passed.
% 1.83/1.27 % [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.39/1.82 % [INFO] Killing All external provers ...
% 3.51/1.82 % Time passed: 1289ms (effective reasoning time: 844ms)
% 3.51/1.82 % 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.51/1.83 % Axioms used in derivation (0):
% 3.51/1.83 % No. of inferences in proof: 18
% 3.51/1.83 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p : 1289 ms resp. 844 ms w/o parsing
% 3.51/1.87 % SZS output start Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 3.51/1.87 % [INFO] Killing All external provers ...
%------------------------------------------------------------------------------