TSTP Solution File: SEU472^1 by Leo-III---1.7.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Leo-III---1.7.12
% Problem : SEU472^1 : TPTP v8.2.0. Released v3.6.0.
% Transfm : none
% Format : tptp:raw
% Command : run_Leo-III %s %d
% Computer : n008.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 03:37:45 EDT 2024
% Result : Theorem 3.39s 1.79s
% Output : Refutation 3.46s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 5
% Syntax : Number of formulae : 8 ( 3 unt; 2 typ; 2 def)
% Number of atoms : 15 ( 4 equ; 0 cnn)
% Maximal formula atoms : 2 ( 2 avg)
% Number of connectives : 50 ( 2 ~; 3 |; 4 &; 34 @)
% ( 0 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 19 ( 5 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 26 ( 26 >; 0 *; 0 +; 0 <<)
% Number of symbols : 8 ( 6 usr; 5 con; 0-3 aty)
% Number of variables : 18 ( 2 ^ 16 !; 0 ?; 18 :)
% Comments :
%------------------------------------------------------------------------------
thf(infl_type,type,
infl: ( ( $i > $i > $o ) > $i > $i > $o ) > $o ).
thf(infl_def,definition,
( infl
= ( ^ [A: ( $i > $i > $o ) > $i > $i > $o] :
! [B: $i > $i > $o] : ( subrel @ B @ ( A @ B ) ) ) ) ).
thf(trsc_type,type,
trsc: ( $i > $i > $o ) > $i > $i > $o ).
thf(trsc_def,definition,
( trsc
= ( ^ [A: $i > $i > $o] : ( sc @ ( rc @ ( tc @ A ) ) ) ) ) ).
thf(1,conjecture,
infl @ trsc,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',transitive_reflexive_symmetric_closure_op_is_inflationary) ).
thf(2,negated_conjecture,
~ ( infl @ trsc ),
inference(neg_conjecture,[status(cth)],[1]) ).
thf(3,plain,
~ ! [A: $i > $i > $o,B: $i,C: $i] :
( ( A @ B @ C )
=> ( ( C = B )
| ! [D: $i > $i > $o] :
( ( ! [E: $i,F: $i,G: $i] :
( ( ( D @ E @ F )
& ( D @ F @ G ) )
=> ( D @ E @ G ) )
& ! [E: $i,F: $i] :
( ( A @ E @ F )
=> ( D @ E @ F ) ) )
=> ( D @ C @ B ) )
| ( B = C )
| ! [D: $i > $i > $o] :
( ( ! [E: $i,F: $i,G: $i] :
( ( ( D @ E @ F )
& ( D @ F @ G ) )
=> ( D @ E @ G ) )
& ! [E: $i,F: $i] :
( ( A @ E @ F )
=> ( D @ E @ F ) ) )
=> ( D @ B @ C ) ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).
thf(18,plain,
$false,
inference(e,[status(thm)],[3]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SEU472^1 : TPTP v8.2.0. Released v3.6.0.
% 0.03/0.15 % Command : run_Leo-III %s %d
% 0.14/0.35 % Computer : n008.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Sun May 19 18:09:39 EDT 2024
% 0.14/0.36 % CPUTime :
% 0.96/0.90 % [INFO] Parsing problem /export/starexec/sandbox/benchmark/theBenchmark.p ...
% 1.40/1.06 % [INFO] Parsing done (158ms).
% 1.40/1.07 % [INFO] Running in sequential loop mode.
% 1.90/1.30 % [INFO] eprover registered as external prover.
% 1.90/1.30 % [INFO] cvc4 registered as external prover.
% 1.90/1.30 % [INFO] Scanning for conjecture ...
% 2.23/1.41 % [INFO] Found a conjecture (or negated_conjecture) and 0 axioms. Running axiom selection ...
% 2.23/1.43 % [INFO] Axiom selection finished. Selected 0 axioms (removed 0 axioms).
% 2.23/1.43 % [INFO] Problem is higher-order (TPTP THF).
% 2.23/1.43 % [INFO] Type checking passed.
% 2.23/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 ...
% 3.39/1.79 % External prover 'e' found a proof!
% 3.39/1.79 % [INFO] Killing All external provers ...
% 3.39/1.79 % Time passed: 1275ms (effective reasoning time: 713ms)
% 3.39/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.39/1.79 % Axioms used in derivation (0):
% 3.39/1.79 % No. of inferences in proof: 4
% 3.39/1.79 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p : 1275 ms resp. 713 ms w/o parsing
% 3.46/1.82 % SZS output start Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 3.46/1.82 % [INFO] Killing All external provers ...
%------------------------------------------------------------------------------