TSTP Solution File: LCL636+1.001 by Leo-III---1.7.10
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Leo-III---1.7.10
% Problem : LCL636+1.001 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_Leo-III %s %d
% Computer : n021.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:55:26 EDT 2024
% Result : Theorem 3.55s 1.81s
% Output : Refutation 3.57s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 7
% Syntax : Number of formulae : 10 ( 1 unt; 6 typ; 0 def)
% Number of atoms : 208 ( 0 equ; 0 cnn)
% Maximal formula atoms : 69 ( 52 avg)
% Number of connectives : 638 ( 185 ~; 123 |; 81 &; 249 @)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 21 ( 16 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 7 ( 7 >; 0 *; 0 +; 0 <<)
% Number of symbols : 7 ( 6 usr; 1 con; 0-2 aty)
% Number of variables : 45 ( 0 ^ 42 !; 3 ?; 45 :)
% Comments :
%------------------------------------------------------------------------------
thf(r1_type,type,
r1: $i > $i > $o ).
thf(p2_type,type,
p2: $i > $o ).
thf(p102_type,type,
p102: $i > $o ).
thf(p101_type,type,
p101: $i > $o ).
thf(p100_type,type,
p100: $i > $o ).
thf(p1_type,type,
p1: $i > $o ).
thf(1,conjecture,
~ ? [A: $i] :
~ ( ~ ! [B: $i] :
( ~ ( r1 @ A @ B )
| ( p2 @ B ) )
| ~ ( ! [B: $i] :
( ~ ( r1 @ A @ B )
| ( ( ( ~ ! [C: $i] :
( ~ ( r1 @ B @ C )
| ~ ( ~ ( p2 @ C )
& ~ ( p102 @ C )
& ( p101 @ C ) ) )
& ~ ! [C: $i] :
( ~ ( r1 @ B @ C )
| ~ ( ( p2 @ C )
& ~ ( p102 @ C )
& ( p101 @ C ) ) ) )
| ~ ( ~ ( p101 @ B )
& ( p100 @ B ) ) )
& ( ( ( ! [C: $i] :
( ~ ( r1 @ B @ C )
| ~ ( p2 @ C )
| ~ ( p101 @ C ) )
| ( p2 @ B ) )
& ( ! [C: $i] :
( ~ ( r1 @ B @ C )
| ( p2 @ C )
| ~ ( p101 @ C ) )
| ~ ( p2 @ B ) ) )
| ~ ( p101 @ B ) )
& ( ( ( ! [C: $i] :
( ~ ( r1 @ B @ C )
| ~ ( p1 @ C )
| ~ ( p100 @ C ) )
| ( p1 @ B ) )
& ( ! [C: $i] :
( ~ ( r1 @ B @ C )
| ( p1 @ C )
| ~ ( p100 @ C ) )
| ~ ( p1 @ B ) ) )
| ~ ( p100 @ B ) )
& ( ( p101 @ B )
| ~ ( p102 @ B ) )
& ( ( p100 @ B )
| ~ ( p101 @ B ) ) ) )
& ( ( ~ ! [B: $i] :
( ~ ( r1 @ A @ B )
| ~ ( ~ ( p2 @ B )
& ~ ( p102 @ B )
& ( p101 @ B ) ) )
& ~ ! [B: $i] :
( ~ ( r1 @ A @ B )
| ~ ( ( p2 @ B )
& ~ ( p102 @ B )
& ( p101 @ B ) ) ) )
| ~ ( ~ ( p101 @ A )
& ( p100 @ A ) ) )
& ( ( ( ! [B: $i] :
( ~ ( r1 @ A @ B )
| ~ ( p2 @ B )
| ~ ( p101 @ B ) )
| ( p2 @ A ) )
& ( ! [B: $i] :
( ~ ( r1 @ A @ B )
| ( p2 @ B )
| ~ ( p101 @ B ) )
| ~ ( p2 @ A ) ) )
| ~ ( p101 @ A ) )
& ( ( ( ! [B: $i] :
( ~ ( r1 @ A @ B )
| ~ ( p1 @ B )
| ~ ( p100 @ B ) )
| ( p1 @ A ) )
& ( ! [B: $i] :
( ~ ( r1 @ A @ B )
| ( p1 @ B )
| ~ ( p100 @ B ) )
| ~ ( p1 @ A ) ) )
| ~ ( p100 @ A ) )
& ( ( p101 @ A )
| ~ ( p102 @ A ) )
& ( ( p100 @ A )
| ~ ( p101 @ A ) )
& ~ ( p101 @ A )
& ( p100 @ A ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',main) ).
thf(2,negated_conjecture,
~ ~ ? [A: $i] :
~ ( ~ ! [B: $i] :
( ~ ( r1 @ A @ B )
| ( p2 @ B ) )
| ~ ( ! [B: $i] :
( ~ ( r1 @ A @ B )
| ( ( ( ~ ! [C: $i] :
( ~ ( r1 @ B @ C )
| ~ ( ~ ( p2 @ C )
& ~ ( p102 @ C )
& ( p101 @ C ) ) )
& ~ ! [C: $i] :
( ~ ( r1 @ B @ C )
| ~ ( ( p2 @ C )
& ~ ( p102 @ C )
& ( p101 @ C ) ) ) )
| ~ ( ~ ( p101 @ B )
& ( p100 @ B ) ) )
& ( ( ( ! [C: $i] :
( ~ ( r1 @ B @ C )
| ~ ( p2 @ C )
| ~ ( p101 @ C ) )
| ( p2 @ B ) )
& ( ! [C: $i] :
( ~ ( r1 @ B @ C )
| ( p2 @ C )
| ~ ( p101 @ C ) )
| ~ ( p2 @ B ) ) )
| ~ ( p101 @ B ) )
& ( ( ( ! [C: $i] :
( ~ ( r1 @ B @ C )
| ~ ( p1 @ C )
| ~ ( p100 @ C ) )
| ( p1 @ B ) )
& ( ! [C: $i] :
( ~ ( r1 @ B @ C )
| ( p1 @ C )
| ~ ( p100 @ C ) )
| ~ ( p1 @ B ) ) )
| ~ ( p100 @ B ) )
& ( ( p101 @ B )
| ~ ( p102 @ B ) )
& ( ( p100 @ B )
| ~ ( p101 @ B ) ) ) )
& ( ( ~ ! [B: $i] :
( ~ ( r1 @ A @ B )
| ~ ( ~ ( p2 @ B )
& ~ ( p102 @ B )
& ( p101 @ B ) ) )
& ~ ! [B: $i] :
( ~ ( r1 @ A @ B )
| ~ ( ( p2 @ B )
& ~ ( p102 @ B )
& ( p101 @ B ) ) ) )
| ~ ( ~ ( p101 @ A )
& ( p100 @ A ) ) )
& ( ( ( ! [B: $i] :
( ~ ( r1 @ A @ B )
| ~ ( p2 @ B )
| ~ ( p101 @ B ) )
| ( p2 @ A ) )
& ( ! [B: $i] :
( ~ ( r1 @ A @ B )
| ( p2 @ B )
| ~ ( p101 @ B ) )
| ~ ( p2 @ A ) ) )
| ~ ( p101 @ A ) )
& ( ( ( ! [B: $i] :
( ~ ( r1 @ A @ B )
| ~ ( p1 @ B )
| ~ ( p100 @ B ) )
| ( p1 @ A ) )
& ( ! [B: $i] :
( ~ ( r1 @ A @ B )
| ( p1 @ B )
| ~ ( p100 @ B ) )
| ~ ( p1 @ A ) ) )
| ~ ( p100 @ A ) )
& ( ( p101 @ A )
| ~ ( p102 @ A ) )
& ( ( p100 @ A )
| ~ ( p101 @ A ) )
& ~ ( p101 @ A )
& ( p100 @ A ) ) ),
inference(neg_conjecture,[status(cth)],[1]) ).
thf(3,plain,
~ ~ ? [A: $i] :
~ ( ~ ! [B: $i] :
( ~ ( r1 @ A @ B )
| ( p2 @ B ) )
| ~ ( ! [B: $i] :
( ~ ( r1 @ A @ B )
| ( ( ( ~ ! [C: $i] :
( ~ ( r1 @ B @ C )
| ~ ( ~ ( p2 @ C )
& ~ ( p102 @ C )
& ( p101 @ C ) ) )
& ~ ! [C: $i] :
( ~ ( r1 @ B @ C )
| ~ ( ( p2 @ C )
& ~ ( p102 @ C )
& ( p101 @ C ) ) ) )
| ~ ( ~ ( p101 @ B )
& ( p100 @ B ) ) )
& ( ( ( ! [C: $i] :
( ~ ( r1 @ B @ C )
| ~ ( p2 @ C )
| ~ ( p101 @ C ) )
| ( p2 @ B ) )
& ( ! [C: $i] :
( ~ ( r1 @ B @ C )
| ( p2 @ C )
| ~ ( p101 @ C ) )
| ~ ( p2 @ B ) ) )
| ~ ( p101 @ B ) )
& ( ( ( ! [C: $i] :
( ~ ( r1 @ B @ C )
| ~ ( p1 @ C )
| ~ ( p100 @ C ) )
| ( p1 @ B ) )
& ( ! [C: $i] :
( ~ ( r1 @ B @ C )
| ( p1 @ C )
| ~ ( p100 @ C ) )
| ~ ( p1 @ B ) ) )
| ~ ( p100 @ B ) )
& ( ( p101 @ B )
| ~ ( p102 @ B ) )
& ( ( p100 @ B )
| ~ ( p101 @ B ) ) ) )
& ( ( ~ ! [B: $i] :
( ~ ( r1 @ A @ B )
| ~ ( ~ ( p2 @ B )
& ~ ( p102 @ B )
& ( p101 @ B ) ) )
& ~ ! [B: $i] :
( ~ ( r1 @ A @ B )
| ~ ( ( p2 @ B )
& ~ ( p102 @ B )
& ( p101 @ B ) ) ) )
| ~ ( ~ ( p101 @ A )
& ( p100 @ A ) ) )
& ( ( ( ! [B: $i] :
( ~ ( r1 @ A @ B )
| ~ ( p2 @ B )
| ~ ( p101 @ B ) )
| ( p2 @ A ) )
& ( ! [B: $i] :
( ~ ( r1 @ A @ B )
| ( p2 @ B )
| ~ ( p101 @ B ) )
| ~ ( p2 @ A ) ) )
| ~ ( p101 @ A ) )
& ( ( ( ! [B: $i] :
( ~ ( r1 @ A @ B )
| ~ ( p1 @ B )
| ~ ( p100 @ B ) )
| ( p1 @ A ) )
& ( ! [B: $i] :
( ~ ( r1 @ A @ B )
| ( p1 @ B )
| ~ ( p100 @ B ) )
| ~ ( p1 @ A ) ) )
| ~ ( p100 @ A ) )
& ( ( p101 @ A )
| ~ ( p102 @ A ) )
& ( ( p100 @ A )
| ~ ( p101 @ A ) )
& ~ ( p101 @ A )
& ( p100 @ A ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).
thf(55,plain,
$false,
inference(e,[status(thm)],[3]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.13/0.13 % Problem : LCL636+1.001 : TPTP v8.1.2. Released v4.0.0.
% 0.13/0.16 % Command : run_Leo-III %s %d
% 0.16/0.37 % Computer : n021.cluster.edu
% 0.16/0.37 % Model : x86_64 x86_64
% 0.16/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.37 % Memory : 8042.1875MB
% 0.16/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.37 % CPULimit : 300
% 0.16/0.37 % WCLimit : 300
% 0.16/0.37 % DateTime : Mon May 6 12:04:54 EDT 2024
% 0.16/0.37 % CPUTime :
% 0.97/0.87 % [INFO] Parsing problem /export/starexec/sandbox/benchmark/theBenchmark.p ...
% 1.20/0.99 % [INFO] Parsing done (121ms).
% 1.20/1.00 % [INFO] Running in sequential loop mode.
% 1.67/1.20 % [INFO] eprover registered as external prover.
% 1.67/1.21 % [INFO] cvc4 registered as external prover.
% 1.67/1.21 % [INFO] Scanning for conjecture ...
% 1.87/1.29 % [INFO] Found a conjecture and 0 axioms. Running axiom selection ...
% 1.87/1.32 % [INFO] Axiom selection finished. Selected 0 axioms (removed 0 axioms).
% 1.87/1.32 % [INFO] Problem is first-order (TPTP FOF).
% 1.87/1.33 % [INFO] Type checking passed.
% 2.13/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 ...
% 3.20/1.77 % External prover 'e' found a proof!
% 3.20/1.77 % [INFO] Killing All external provers ...
% 3.47/1.81 % Time passed: 1267ms (effective reasoning time: 807ms)
% 3.47/1.81 % 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.55/1.81 % Axioms used in derivation (0):
% 3.55/1.81 % No. of inferences in proof: 4
% 3.55/1.81 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p : 1267 ms resp. 807 ms w/o parsing
% 3.57/1.86 % SZS output start Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 3.57/1.86 % [INFO] Killing All external provers ...
%------------------------------------------------------------------------------