TSTP Solution File: SEV060^5 by Leo-III-SAT---1.7.15
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Leo-III-SAT---1.7.15
% Problem : SEV060^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 15:59:26 EDT 2024
% Result : Theorem 3.46s 1.79s
% Output : Refutation 3.46s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 1
% Syntax : Number of formulae : 25 ( 10 unt; 0 typ; 0 def)
% Number of atoms : 52 ( 26 equ; 0 cnn)
% Maximal formula atoms : 3 ( 2 avg)
% Number of connectives : 132 ( 20 ~; 21 |; 6 &; 76 @)
% ( 0 <=>; 9 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 5 avg)
% Number of types : 3 ( 2 usr)
% Number of type conns : 12 ( 12 >; 0 *; 0 +; 0 <<)
% Number of symbols : 8 ( 6 usr; 5 con; 0-2 aty)
% Number of variables : 36 ( 0 ^ 36 !; 0 ?; 36 :)
% Comments :
%------------------------------------------------------------------------------
thf(b_type,type,
b: $tType ).
thf(a_type,type,
a: $tType ).
thf(sk1_type,type,
sk1: b ).
thf(sk2_type,type,
sk2: a ).
thf(sk3_type,type,
sk3: b > a > $o ).
thf(sk4_type,type,
sk4: b > a > $o ).
thf(sk5_type,type,
sk5: b ).
thf(sk6_type,type,
sk6: a ).
thf(1,conjecture,
! [A: b,B: a,C: b > a > $o,D: b > a > $o] :
( ( ! [E: b,F: a] :
( ( D @ E @ F )
=> ( ( C @ E @ F )
| ( ( E = A )
& ( F = B ) ) ) )
& ~ ( D @ A @ B ) )
=> ! [E: b,F: a] :
( ( D @ E @ F )
=> ( C @ E @ F ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cTHM173_pme) ).
thf(2,negated_conjecture,
~ ! [A: b,B: a,C: b > a > $o,D: b > a > $o] :
( ( ! [E: b,F: a] :
( ( D @ E @ F )
=> ( ( C @ E @ F )
| ( ( E = A )
& ( F = B ) ) ) )
& ~ ( D @ A @ B ) )
=> ! [E: b,F: a] :
( ( D @ E @ F )
=> ( C @ E @ F ) ) ),
inference(neg_conjecture,[status(cth)],[1]) ).
thf(3,plain,
~ ! [A: b,B: a,C: b > a > $o,D: b > a > $o] :
( ( ! [E: b,F: a] :
( ( D @ E @ F )
=> ( ( C @ E @ F )
| ( ( E = A )
& ( F = B ) ) ) )
& ~ ( D @ A @ B ) )
=> ! [E: b,F: a] :
( ( D @ E @ F )
=> ( C @ E @ F ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).
thf(8,plain,
sk4 @ sk5 @ sk6,
inference(cnf,[status(esa)],[3]) ).
thf(5,plain,
! [B: a,A: b] :
( ~ ( sk4 @ A @ B )
| ( sk3 @ A @ B )
| ( B = sk2 ) ),
inference(cnf,[status(esa)],[3]) ).
thf(9,plain,
! [B: a,A: b] :
( ( B = sk2 )
| ~ ( sk4 @ A @ B )
| ( sk3 @ A @ B ) ),
inference(lifteq,[status(thm)],[5]) ).
thf(19,plain,
! [B: a,A: b] :
( ( B = sk2 )
| ( sk3 @ A @ B )
| ( ( sk4 @ sk5 @ sk6 )
!= ( sk4 @ A @ B ) ) ),
inference(paramod_ordered,[status(thm)],[8,9]) ).
thf(20,plain,
( ( sk6 = sk2 )
| ( sk3 @ sk5 @ sk6 ) ),
inference(pattern_uni,[status(thm)],[19:[bind(A,$thf( sk5 )),bind(B,$thf( sk6 ))]]) ).
thf(6,plain,
~ ( sk3 @ sk5 @ sk6 ),
inference(cnf,[status(esa)],[3]) ).
thf(30,plain,
( ( sk6 = sk2 )
| $false ),
inference(rewrite,[status(thm)],[20,6]) ).
thf(31,plain,
sk6 = sk2,
inference(simp,[status(thm)],[30]) ).
thf(36,plain,
sk4 @ sk5 @ sk2,
inference(rewrite,[status(thm)],[8,31]) ).
thf(7,plain,
! [B: a,A: b] :
( ~ ( sk4 @ A @ B )
| ( sk3 @ A @ B )
| ( A = sk1 ) ),
inference(cnf,[status(esa)],[3]) ).
thf(10,plain,
! [B: a,A: b] :
( ( A = sk1 )
| ~ ( sk4 @ A @ B )
| ( sk3 @ A @ B ) ),
inference(lifteq,[status(thm)],[7]) ).
thf(54,plain,
! [B: a,A: b] :
( ( A = sk1 )
| ( sk3 @ A @ B )
| ( ( sk4 @ sk5 @ sk2 )
!= ( sk4 @ A @ B ) ) ),
inference(paramod_ordered,[status(thm)],[36,10]) ).
thf(55,plain,
( ( sk5 = sk1 )
| ( sk3 @ sk5 @ sk2 ) ),
inference(pattern_uni,[status(thm)],[54:[bind(A,$thf( sk5 )),bind(B,$thf( sk2 ))]]) ).
thf(32,plain,
~ ( sk3 @ sk5 @ sk2 ),
inference(rewrite,[status(thm)],[6,31]) ).
thf(69,plain,
( ( sk5 = sk1 )
| $false ),
inference(rewrite,[status(thm)],[55,32]) ).
thf(70,plain,
sk5 = sk1,
inference(simp,[status(thm)],[69]) ).
thf(4,plain,
~ ( sk4 @ sk1 @ sk2 ),
inference(cnf,[status(esa)],[3]) ).
thf(11,plain,
( ( sk4 @ sk5 @ sk6 )
!= ( sk4 @ sk1 @ sk2 ) ),
inference(paramod_ordered,[status(thm)],[8,4]) ).
thf(12,plain,
( ( sk5 != sk1 )
| ( sk6 != sk2 ) ),
inference(simp,[status(thm)],[11]) ).
thf(33,plain,
( ( sk5 != sk1 )
| ( sk2 != sk2 ) ),
inference(rewrite,[status(thm)],[12,31]) ).
thf(34,plain,
sk5 != sk1,
inference(simp,[status(thm)],[33]) ).
thf(71,plain,
$false,
inference(simplifyReflect,[status(thm)],[70,34]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SEV060^5 : TPTP v8.2.0. Released v4.0.0.
% 0.11/0.12 % Command : run_Leo-III %s %d SAT
% 0.12/0.33 % Computer : n028.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:41:10 EDT 2024
% 0.12/0.33 % CPUTime :
% 0.98/0.88 % [INFO] Parsing problem /export/starexec/sandbox2/benchmark/theBenchmark.p ...
% 1.08/1.00 % [INFO] Parsing done (120ms).
% 1.31/1.01 % [INFO] Running in sequential loop mode.
% 1.74/1.23 % [INFO] nitpick registered as external prover.
% 1.74/1.24 % [INFO] Scanning for conjecture ...
% 1.74/1.29 % [INFO] Found a conjecture (or negated_conjecture) and 0 axioms. Running axiom selection ...
% 1.74/1.32 % [INFO] Axiom selection finished. Selected 0 axioms (removed 0 axioms).
% 1.74/1.32 % [INFO] Problem is higher-order (TPTP THF).
% 1.74/1.32 % [INFO] Type checking passed.
% 2.00/1.33 % [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.94/1.79 % [INFO] Killing All external provers ...
% 3.46/1.79 % Time passed: 1269ms (effective reasoning time: 770ms)
% 3.46/1.79 % 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.46/1.79 % Axioms used in derivation (0):
% 3.46/1.79 % No. of inferences in proof: 25
% 3.46/1.79 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p : 1269 ms resp. 770 ms w/o parsing
% 3.46/1.82 % SZS output start Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 3.46/1.82 % [INFO] Killing All external provers ...
%------------------------------------------------------------------------------