TSTP Solution File: SEV233^5 by Leo-III-SAT---1.7.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Leo-III-SAT---1.7.12
% Problem : SEV233^5 : TPTP v8.2.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_Leo-III %s %d
% Computer : n017.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 04:11:10 EDT 2024
% Result : Theorem 2.92s 1.89s
% Output : Refutation 3.09s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 6
% Syntax : Number of formulae : 30 ( 7 unt; 5 typ; 0 def)
% Number of atoms : 61 ( 5 equ; 0 cnn)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 114 ( 18 ~; 17 |; 6 &; 61 @)
% ( 0 <=>; 12 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 6 ( 6 >; 0 *; 0 +; 0 <<)
% Number of symbols : 8 ( 5 usr; 4 con; 0-2 aty)
% Number of variables : 18 ( 0 ^ 18 !; 0 ?; 18 :)
% Comments :
%------------------------------------------------------------------------------
thf(cE_type,type,
cE: $i > $o ).
thf(cD_type,type,
cD: $i > $o ).
thf(sk1_type,type,
sk1: $i > $o ).
thf(sk2_type,type,
sk2: $i ).
thf(sk3_type,type,
sk3: $i ).
thf(1,conjecture,
! [A: $i > $o] :
( ! [B: $i] :
( ( A @ B )
=> ( ( cD @ B )
& ( cE @ B ) ) )
=> ( ! [B: $i] :
( ( A @ B )
=> ( cD @ B ) )
& ! [B: $i] :
( ( A @ B )
=> ( cE @ B ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cTHM46_pme) ).
thf(2,negated_conjecture,
~ ! [A: $i > $o] :
( ! [B: $i] :
( ( A @ B )
=> ( ( cD @ B )
& ( cE @ B ) ) )
=> ( ! [B: $i] :
( ( A @ B )
=> ( cD @ B ) )
& ! [B: $i] :
( ( A @ B )
=> ( cE @ B ) ) ) ),
inference(neg_conjecture,[status(cth)],[1]) ).
thf(3,plain,
~ ! [A: $i > $o] :
( ! [B: $i] :
( ( A @ B )
=> ( ( cD @ B )
& ( cE @ B ) ) )
=> ( ! [B: $i] :
( ( A @ B )
=> ( cD @ B ) )
& ! [B: $i] :
( ( A @ B )
=> ( cE @ B ) ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).
thf(6,plain,
( ~ ( cD @ sk2 )
| ( sk1 @ sk3 ) ),
inference(cnf,[status(esa)],[3]) ).
thf(4,plain,
( ( sk1 @ sk2 )
| ( sk1 @ sk3 ) ),
inference(cnf,[status(esa)],[3]) ).
thf(9,plain,
! [A: $i] :
( ~ ( sk1 @ A )
| ( cE @ A ) ),
inference(cnf,[status(esa)],[3]) ).
thf(49,plain,
! [A: $i] :
( ( sk1 @ sk2 )
| ( cE @ A )
| ( ( sk1 @ sk3 )
!= ( sk1 @ A ) ) ),
inference(paramod_ordered,[status(thm)],[4,9]) ).
thf(50,plain,
( ( sk1 @ sk2 )
| ( cE @ sk3 ) ),
inference(pattern_uni,[status(thm)],[49:[bind(A,$thf( sk3 ))]]) ).
thf(7,plain,
( ( sk1 @ sk2 )
| ~ ( cE @ sk3 ) ),
inference(cnf,[status(esa)],[3]) ).
thf(5,plain,
! [A: $i] :
( ~ ( sk1 @ A )
| ( cD @ A ) ),
inference(cnf,[status(esa)],[3]) ).
thf(27,plain,
! [A: $i] :
( ~ ( cE @ sk3 )
| ( cD @ A )
| ( ( sk1 @ sk2 )
!= ( sk1 @ A ) ) ),
inference(paramod_ordered,[status(thm)],[7,5]) ).
thf(28,plain,
( ~ ( cE @ sk3 )
| ( cD @ sk2 ) ),
inference(pattern_uni,[status(thm)],[27:[bind(A,$thf( sk2 ))]]) ).
thf(8,plain,
( ~ ( cD @ sk2 )
| ~ ( cE @ sk3 ) ),
inference(cnf,[status(esa)],[3]) ).
thf(55,plain,
( ~ ( cE @ sk3 )
| ( ( cD @ sk2 )
!= ( cD @ sk2 ) ) ),
inference(paramod_ordered,[status(thm)],[28,8]) ).
thf(56,plain,
~ ( cE @ sk3 ),
inference(pattern_uni,[status(thm)],[55:[]]) ).
thf(70,plain,
( ( sk1 @ sk2 )
| $false ),
inference(rewrite,[status(thm)],[50,56]) ).
thf(71,plain,
sk1 @ sk2,
inference(simp,[status(thm)],[70]) ).
thf(72,plain,
! [A: $i] :
( ( cD @ A )
| ( ( sk1 @ sk2 )
!= ( sk1 @ A ) ) ),
inference(paramod_ordered,[status(thm)],[71,5]) ).
thf(73,plain,
cD @ sk2,
inference(pattern_uni,[status(thm)],[72:[bind(A,$thf( sk2 ))]]) ).
thf(78,plain,
( ~ $true
| ( sk1 @ sk3 ) ),
inference(rewrite,[status(thm)],[6,73]) ).
thf(79,plain,
sk1 @ sk3,
inference(simp,[status(thm)],[78]) ).
thf(86,plain,
! [A: $i] :
( ( cE @ A )
| ( ( sk1 @ sk3 )
!= ( sk1 @ A ) ) ),
inference(paramod_ordered,[status(thm)],[79,9]) ).
thf(87,plain,
cE @ sk3,
inference(pattern_uni,[status(thm)],[86:[bind(A,$thf( sk3 ))]]) ).
thf(88,plain,
$false,
inference(rewrite,[status(thm)],[87,56]) ).
thf(89,plain,
$false,
inference(simp,[status(thm)],[88]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.09 % Problem : SEV233^5 : TPTP v8.2.0. Released v4.0.0.
% 0.02/0.11 % Command : run_Leo-III %s %d
% 0.11/0.31 % Computer : n017.cluster.edu
% 0.11/0.31 % Model : x86_64 x86_64
% 0.11/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.31 % Memory : 8042.1875MB
% 0.11/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.31 % CPULimit : 300
% 0.11/0.31 % WCLimit : 300
% 0.11/0.31 % DateTime : Sun May 19 19:14:54 EDT 2024
% 0.11/0.31 % CPUTime :
% 0.93/0.88 % [INFO] Parsing problem /export/starexec/sandbox2/benchmark/theBenchmark.p ...
% 1.12/0.99 % [INFO] Parsing done (105ms).
% 1.12/0.99 % [INFO] Running in sequential loop mode.
% 1.58/1.23 % [INFO] nitpick registered as external prover.
% 1.58/1.24 % [INFO] Scanning for conjecture ...
% 1.64/1.32 % [INFO] Found a conjecture (or negated_conjecture) and 0 axioms. Running axiom selection ...
% 1.80/1.35 % [INFO] Axiom selection finished. Selected 0 axioms (removed 0 axioms).
% 1.80/1.35 % [INFO] Problem is higher-order (TPTP THF).
% 1.80/1.35 % [INFO] Type checking passed.
% 1.80/1.36 % [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.92/1.88 % [INFO] Killing All external provers ...
% 2.92/1.89 % Time passed: 1423ms (effective reasoning time: 887ms)
% 2.92/1.89 % 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.92/1.89 % Axioms used in derivation (0):
% 2.92/1.89 % No. of inferences in proof: 25
% 2.92/1.89 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p : 1423 ms resp. 887 ms w/o parsing
% 3.09/1.92 % SZS output start Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 3.09/1.92 % [INFO] Killing All external provers ...
%------------------------------------------------------------------------------