TSTP Solution File: SEV185^5 by Leo-III-SAT---1.7.15
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Leo-III-SAT---1.7.15
% Problem : SEV185^5 : TPTP v8.2.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_Leo-III %s %d SAT
% Computer : n023.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:42 EDT 2024
% Result : Theorem 9.78s 2.74s
% Output : Refutation 9.78s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 1
% Syntax : Number of formulae : 26 ( 2 unt; 0 typ; 0 def)
% Number of atoms : 73 ( 6 equ; 0 cnn)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 242 ( 35 ~; 32 |; 6 &; 145 @)
% ( 0 <=>; 24 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 7 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 45 ( 45 >; 0 *; 0 +; 0 <<)
% Number of symbols : 9 ( 6 usr; 3 con; 0-3 aty)
% Number of variables : 57 ( 0 ^ 57 !; 0 ?; 57 :)
% Comments :
%------------------------------------------------------------------------------
thf(b_type,type,
b: $tType ).
thf(sk1_type,type,
sk1: ( b > $o ) > b > $o ).
thf(sk2_type,type,
sk2: ( b > $o ) > $o ).
thf(sk3_type,type,
sk3: b > ( b > $o ) > ( b > $o ) > b ).
thf(sk4_type,type,
sk4: b > $o ).
thf(sk5_type,type,
sk5: b ).
thf(sk6_type,type,
sk6: b > $o ).
thf(1,conjecture,
! [A: ( b > $o ) > b > $o,B: ( b > $o ) > $o] :
( ! [C: b > $o] :
( ( B @ C )
=> ! [D: b > $o,E: b] :
( ( ! [F: b] :
( ( D @ F )
=> ( C @ F ) )
& ( A @ D @ E ) )
=> ( C @ E ) ) )
=> ! [C: b > $o,D: b] :
( ( ! [E: b] :
( ( C @ E )
=> ! [F: b > $o] :
( ( B @ F )
=> ( F @ E ) ) )
& ( A @ C @ D ) )
=> ! [E: b > $o] :
( ( B @ E )
=> ( E @ D ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cTHM564_pme) ).
thf(2,negated_conjecture,
~ ! [A: ( b > $o ) > b > $o,B: ( b > $o ) > $o] :
( ! [C: b > $o] :
( ( B @ C )
=> ! [D: b > $o,E: b] :
( ( ! [F: b] :
( ( D @ F )
=> ( C @ F ) )
& ( A @ D @ E ) )
=> ( C @ E ) ) )
=> ! [C: b > $o,D: b] :
( ( ! [E: b] :
( ( C @ E )
=> ! [F: b > $o] :
( ( B @ F )
=> ( F @ E ) ) )
& ( A @ C @ D ) )
=> ! [E: b > $o] :
( ( B @ E )
=> ( E @ D ) ) ) ),
inference(neg_conjecture,[status(cth)],[1]) ).
thf(3,plain,
~ ! [A: ( b > $o ) > b > $o,B: ( b > $o ) > $o] :
( ! [C: b > $o] :
( ( B @ C )
=> ! [D: b > $o,E: b] :
( ( ! [F: b] :
( ( D @ F )
=> ( C @ F ) )
& ( A @ D @ E ) )
=> ( C @ E ) ) )
=> ! [C: b > $o,D: b] :
( ( ! [E: b] :
( ( C @ E )
=> ! [F: b > $o] :
( ( B @ F )
=> ( F @ E ) ) )
& ( A @ C @ D ) )
=> ! [E: b > $o] :
( ( B @ E )
=> ( E @ D ) ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).
thf(6,plain,
sk1 @ sk4 @ sk5,
inference(cnf,[status(esa)],[3]) ).
thf(7,plain,
! [C: b,B: b > $o,A: b > $o] :
( ~ ( sk2 @ A )
| ( B @ ( sk3 @ C @ B @ A ) )
| ~ ( sk1 @ B @ C )
| ( A @ C ) ),
inference(cnf,[status(esa)],[3]) ).
thf(350,plain,
! [C: b,B: b > $o,A: b > $o] :
( ~ ( sk2 @ A )
| ( B @ ( sk3 @ C @ B @ A ) )
| ( A @ C )
| ( ( sk1 @ sk4 @ sk5 )
!= ( sk1 @ B @ C ) ) ),
inference(paramod_ordered,[status(thm)],[6,7]) ).
thf(351,plain,
! [A: b > $o] :
( ~ ( sk2 @ A )
| ( sk4 @ ( sk3 @ sk5 @ sk4 @ A ) )
| ( A @ sk5 ) ),
inference(pattern_uni,[status(thm)],[350:[bind(A,$thf( A )),bind(B,$thf( sk4 )),bind(C,$thf( sk5 ))]]) ).
thf(9,plain,
sk2 @ sk6,
inference(cnf,[status(esa)],[3]) ).
thf(8,plain,
! [B: b > $o,A: b] :
( ~ ( sk4 @ A )
| ~ ( sk2 @ B )
| ( B @ A ) ),
inference(cnf,[status(esa)],[3]) ).
thf(10,plain,
! [B: b > $o,A: b] :
( ~ ( sk4 @ A )
| ~ ( sk2 @ B )
| ( B @ A ) ),
inference(simp,[status(thm)],[8]) ).
thf(12,plain,
! [B: b > $o,A: b] :
( ~ ( sk4 @ A )
| ( B @ A )
| ( ( sk2 @ sk6 )
!= ( sk2 @ B ) ) ),
inference(paramod_ordered,[status(thm)],[9,10]) ).
thf(13,plain,
! [A: b] :
( ~ ( sk4 @ A )
| ( sk6 @ A ) ),
inference(pattern_uni,[status(thm)],[12:[bind(A,$thf( A )),bind(B,$thf( sk6 ))]]) ).
thf(5,plain,
! [C: b,B: b > $o,A: b > $o] :
( ~ ( sk2 @ A )
| ~ ( A @ ( sk3 @ C @ B @ A ) )
| ~ ( sk1 @ B @ C )
| ( A @ C ) ),
inference(cnf,[status(esa)],[3]) ).
thf(77,plain,
! [C: b,B: b > $o,A: b > $o] :
( ~ ( sk2 @ A )
| ~ ( A @ ( sk3 @ C @ B @ A ) )
| ( A @ C )
| ( ( sk1 @ sk4 @ sk5 )
!= ( sk1 @ B @ C ) ) ),
inference(paramod_ordered,[status(thm)],[6,5]) ).
thf(78,plain,
! [A: b > $o] :
( ~ ( sk2 @ A )
| ~ ( A @ ( sk3 @ sk5 @ sk4 @ A ) )
| ( A @ sk5 ) ),
inference(pattern_uni,[status(thm)],[77:[bind(A,$thf( A )),bind(B,$thf( sk4 )),bind(C,$thf( sk5 ))]]) ).
thf(594,plain,
! [A: b > $o] :
( ~ ( A @ ( sk3 @ sk5 @ sk4 @ A ) )
| ( A @ sk5 )
| ( ( sk2 @ sk6 )
!= ( sk2 @ A ) ) ),
inference(paramod_ordered,[status(thm)],[9,78]) ).
thf(595,plain,
( ~ ( sk6 @ ( sk3 @ sk5 @ sk4 @ sk6 ) )
| ( sk6 @ sk5 ) ),
inference(pattern_uni,[status(thm)],[594:[bind(A,$thf( sk6 ))]]) ).
thf(4,plain,
~ ( sk6 @ sk5 ),
inference(cnf,[status(esa)],[3]) ).
thf(721,plain,
( ~ ( sk6 @ ( sk3 @ sk5 @ sk4 @ sk6 ) )
| $false ),
inference(rewrite,[status(thm)],[595,4]) ).
thf(722,plain,
~ ( sk6 @ ( sk3 @ sk5 @ sk4 @ sk6 ) ),
inference(simp,[status(thm)],[721]) ).
thf(726,plain,
! [A: b] :
( ~ ( sk4 @ A )
| ( ( sk6 @ A )
!= ( sk6 @ ( sk3 @ sk5 @ sk4 @ sk6 ) ) ) ),
inference(paramod_ordered,[status(thm)],[13,722]) ).
thf(727,plain,
~ ( sk4 @ ( sk3 @ sk5 @ sk4 @ sk6 ) ),
inference(pattern_uni,[status(thm)],[726:[bind(A,$thf( sk3 @ sk5 @ sk4 @ sk6 ))]]) ).
thf(806,plain,
! [A: b > $o] :
( ~ ( sk2 @ A )
| ( A @ sk5 )
| ( ( sk4 @ ( sk3 @ sk5 @ sk4 @ A ) )
!= ( sk4 @ ( sk3 @ sk5 @ sk4 @ sk6 ) ) ) ),
inference(paramod_ordered,[status(thm)],[351,727]) ).
thf(807,plain,
( ~ ( sk2 @ sk6 )
| ( sk6 @ sk5 ) ),
inference(pattern_uni,[status(thm)],[806:[bind(A,$thf( sk6 ))]]) ).
thf(971,plain,
( ~ $true
| $false ),
inference(rewrite,[status(thm)],[807,4,9]) ).
thf(972,plain,
$false,
inference(simp,[status(thm)],[971]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SEV185^5 : TPTP v8.2.0. Released v4.0.0.
% 0.07/0.12 % Command : run_Leo-III %s %d SAT
% 0.13/0.34 % Computer : n023.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Fri Jun 21 19:00:55 EDT 2024
% 0.13/0.34 % CPUTime :
% 0.96/0.86 % [INFO] Parsing problem /export/starexec/sandbox/benchmark/theBenchmark.p ...
% 1.18/0.96 % [INFO] Parsing done (94ms).
% 1.18/0.96 % [INFO] Running in sequential loop mode.
% 1.53/1.16 % [INFO] nitpick registered as external prover.
% 1.53/1.17 % [INFO] Scanning for conjecture ...
% 1.64/1.22 % [INFO] Found a conjecture (or negated_conjecture) and 0 axioms. Running axiom selection ...
% 1.64/1.24 % [INFO] Axiom selection finished. Selected 0 axioms (removed 0 axioms).
% 1.64/1.24 % [INFO] Problem is higher-order (TPTP THF).
% 1.85/1.24 % [INFO] Type checking passed.
% 1.85/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 ...
% 9.78/2.74 % [INFO] Killing All external provers ...
% 9.78/2.74 % Time passed: 2204ms (effective reasoning time: 1769ms)
% 9.78/2.74 % 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)>
% 9.78/2.74 % Axioms used in derivation (0):
% 9.78/2.74 % No. of inferences in proof: 26
% 9.78/2.74 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p : 2204 ms resp. 1769 ms w/o parsing
% 9.78/2.77 % SZS output start Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 9.78/2.77 % [INFO] Killing All external provers ...
%------------------------------------------------------------------------------