TSTP Solution File: COL009-1 by Leo-III---1.7.10
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Leo-III---1.7.10
% Problem : COL009-1 : TPTP v8.1.2. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_Leo-III %s %d
% Computer : n020.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 7 07:29:13 EDT 2024
% Result : Unsatisfiable 34.14s 6.92s
% Output : Refutation 34.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 2
% Number of leaves : 7
% Syntax : Number of formulae : 11 ( 7 unt; 4 typ; 0 def)
% Number of atoms : 7 ( 6 equ; 0 cnn)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 42 ( 2 ~; 0 |; 0 &; 40 @)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 3 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 2 ( 2 >; 0 *; 0 +; 0 <<)
% Number of symbols : 6 ( 4 usr; 4 con; 0-2 aty)
% Number of variables : 12 ( 0 ^ 12 !; 0 ?; 12 :)
% Comments :
%------------------------------------------------------------------------------
thf(apply_type,type,
apply: $i > $i > $i ).
thf(combinator_type,type,
combinator: $i ).
thf(b_type,type,
b: $i ).
thf(l2_type,type,
l2: $i ).
thf(1,negated_conjecture,
! [A: $i] :
( A
!= ( apply @ combinator @ A ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_fixed_point) ).
thf(4,plain,
! [A: $i] :
( A
!= ( apply @ combinator @ A ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[1]) ).
thf(2,axiom,
! [C: $i,B: $i,A: $i] :
( ( apply @ ( apply @ ( apply @ b @ A ) @ B ) @ C )
= ( apply @ A @ ( apply @ B @ C ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',b_definition) ).
thf(7,plain,
! [C: $i,B: $i,A: $i] :
( ( apply @ ( apply @ ( apply @ b @ A ) @ B ) @ C )
= ( apply @ A @ ( apply @ B @ C ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).
thf(3,axiom,
! [B: $i,A: $i] :
( ( apply @ ( apply @ l2 @ A ) @ B )
= ( apply @ B @ ( apply @ A @ A ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l2_definition) ).
thf(9,plain,
! [B: $i,A: $i] :
( ( apply @ ( apply @ l2 @ A ) @ B )
= ( apply @ B @ ( apply @ A @ A ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[3]) ).
thf(17048,plain,
$false,
inference(e,[status(thm)],[4,7,9]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : COL009-1 : TPTP v8.1.2. Released v1.0.0.
% 0.07/0.16 % Command : run_Leo-III %s %d
% 0.15/0.38 % Computer : n020.cluster.edu
% 0.15/0.38 % Model : x86_64 x86_64
% 0.15/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.38 % Memory : 8042.1875MB
% 0.15/0.38 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.38 % CPULimit : 300
% 0.15/0.38 % WCLimit : 300
% 0.15/0.38 % DateTime : Mon May 6 14:04:39 EDT 2024
% 0.15/0.38 % CPUTime :
% 0.95/0.91 % [INFO] Parsing problem /export/starexec/sandbox2/benchmark/theBenchmark.p ...
% 1.23/1.02 % [INFO] Parsing done (107ms).
% 1.23/1.02 % [INFO] Running in sequential loop mode.
% 1.75/1.25 % [INFO] eprover registered as external prover.
% 1.75/1.25 % [INFO] cvc4 registered as external prover.
% 1.75/1.25 % [INFO] Scanning for conjecture ...
% 1.85/1.30 % [INFO] Found a conjecture and 2 axioms. Running axiom selection ...
% 1.85/1.31 % [INFO] Axiom selection finished. Selected 2 axioms (removed 0 axioms).
% 1.85/1.32 % [INFO] Problem is propositional (TPTP CNF).
% 1.85/1.32 % [INFO] Type checking passed.
% 1.85/1.32 % [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 ...
% 34.14/6.91 % External prover 'e' found a proof!
% 34.14/6.91 % [INFO] Killing All external provers ...
% 34.14/6.91 % Time passed: 6368ms (effective reasoning time: 5887ms)
% 34.14/6.91 % 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)>
% 34.14/6.92 % Axioms used in derivation (2): b_definition, l2_definition
% 34.14/6.92 % No. of inferences in proof: 7
% 34.14/6.92 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p : 6368 ms resp. 5887 ms w/o parsing
% 34.14/6.93 % SZS output start Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 34.14/6.93 % [INFO] Killing All external provers ...
%------------------------------------------------------------------------------