TSTP Solution File: SEV218^5 by Leo-III---1.7.15
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Leo-III---1.7.15
% Problem : SEV218^5 : TPTP v8.2.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_Leo-III %s %d THM
% 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 : Mon Jun 24 15:58:31 EDT 2024
% Result : Theorem 2.89s 1.82s
% Output : Refutation 3.03s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 1
% Syntax : Number of formulae : 4 ( 1 unt; 0 typ; 0 def)
% Number of atoms : 25 ( 3 equ; 0 cnn)
% Maximal formula atoms : 7 ( 6 avg)
% Number of connectives : 95 ( 2 ~; 0 |; 15 &; 66 @)
% ( 0 <=>; 12 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 9 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 6 ( 6 >; 0 *; 0 +; 0 <<)
% Number of symbols : 3 ( 1 usr; 1 con; 0-2 aty)
% Number of variables : 33 ( 0 ^ 27 !; 6 ?; 33 :)
% Comments :
%------------------------------------------------------------------------------
thf(a_type,type,
a: $tType ).
thf(cQ_type,type,
cQ: a > a > $o ).
thf(1,conjecture,
( ? [A: a > a > $o] :
! [B: a] :
( ? [C: a] : ( A @ B @ C )
& ! [C: a] :
( ( A @ B @ C )
=> ! [D: a] :
( ( A @ B @ D )
= ( cQ @ C @ D ) ) )
& ( A @ B @ B ) )
=> ( ! [A: a] : ( cQ @ A @ A )
& ! [A: a,B: a] :
( ( cQ @ A @ B )
=> ( cQ @ B @ A ) )
& ! [A: a,B: a,C: a] :
( ( ( cQ @ A @ B )
& ( cQ @ B @ C ) )
=> ( cQ @ A @ C ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cTHM559A_pme) ).
thf(2,negated_conjecture,
~ ( ? [A: a > a > $o] :
! [B: a] :
( ? [C: a] : ( A @ B @ C )
& ! [C: a] :
( ( A @ B @ C )
=> ! [D: a] :
( ( A @ B @ D )
= ( cQ @ C @ D ) ) )
& ( A @ B @ B ) )
=> ( ! [A: a] : ( cQ @ A @ A )
& ! [A: a,B: a] :
( ( cQ @ A @ B )
=> ( cQ @ B @ A ) )
& ! [A: a,B: a,C: a] :
( ( ( cQ @ A @ B )
& ( cQ @ B @ C ) )
=> ( cQ @ A @ C ) ) ) ),
inference(neg_conjecture,[status(cth)],[1]) ).
thf(3,plain,
~ ( ? [A: a > a > $o] :
! [B: a] :
( ? [C: a] : ( A @ B @ C )
& ! [C: a] :
( ( A @ B @ C )
=> ! [D: a] :
( ( A @ B @ D )
= ( cQ @ C @ D ) ) )
& ( A @ B @ B ) )
=> ( ! [A: a] : ( cQ @ A @ A )
& ! [A: a,B: a] :
( ( cQ @ A @ B )
=> ( cQ @ B @ A ) )
& ! [A: a,B: a,C: a] :
( ( ( cQ @ A @ B )
& ( cQ @ B @ C ) )
=> ( cQ @ A @ C ) ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).
thf(17,plain,
$false,
inference(e,[status(thm)],[3]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : SEV218^5 : TPTP v8.2.0. Released v4.0.0.
% 0.08/0.13 % Command : run_Leo-III %s %d THM
% 0.13/0.34 % Computer : n017.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 18:59:25 EDT 2024
% 0.13/0.35 % CPUTime :
% 1.05/0.92 % [INFO] Parsing problem /export/starexec/sandbox/benchmark/theBenchmark.p ...
% 1.25/1.04 % [INFO] Parsing done (119ms).
% 1.25/1.05 % [INFO] Running in sequential loop mode.
% 1.80/1.33 % [INFO] eprover registered as external prover.
% 1.80/1.33 % [INFO] Scanning for conjecture ...
% 1.97/1.40 % [INFO] Found a conjecture (or negated_conjecture) and 0 axioms. Running axiom selection ...
% 1.97/1.43 % [INFO] Axiom selection finished. Selected 0 axioms (removed 0 axioms).
% 1.97/1.43 % [INFO] Problem is higher-order (TPTP THF).
% 1.97/1.43 % [INFO] Type checking passed.
% 1.97/1.43 % [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.89/1.82 % External prover 'e' found a proof!
% 2.89/1.82 % [INFO] Killing All external provers ...
% 2.89/1.82 % Time passed: 1282ms (effective reasoning time: 768ms)
% 2.89/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)>
% 2.89/1.82 % Axioms used in derivation (0):
% 2.89/1.82 % No. of inferences in proof: 4
% 2.89/1.82 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p : 1282 ms resp. 768 ms w/o parsing
% 3.03/1.85 % SZS output start Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 3.03/1.85 % [INFO] Killing All external provers ...
%------------------------------------------------------------------------------