TSTP Solution File: LCL652+1.001 by Leo-III---1.7.7
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Leo-III---1.7.7
% Problem : LCL652+1.001 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_Leo-III %s %d
% Computer : n016.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 : Fri May 19 11:30:59 EDT 2023
% Result : Theorem 5.30s 2.38s
% Output : Refutation 5.40s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 6
% Syntax : Number of formulae : 9 ( 1 unt; 5 typ; 0 def)
% Number of atoms : 223 ( 0 equ; 0 cnn)
% Maximal formula atoms : 74 ( 55 avg)
% Number of connectives : 887 ( 299 ~; 198 |; 21 &; 369 @)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 35 ( 26 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 6 ( 6 >; 0 *; 0 +; 0 <<)
% Number of symbols : 6 ( 5 usr; 1 con; 0-2 aty)
% Number of variables : 150 ( 0 ^; 147 !; 3 ?; 150 :)
% Comments :
%------------------------------------------------------------------------------
thf(r1_type,type,
r1: $i > $i > $o ).
thf(p4_type,type,
p4: $i > $o ).
thf(p1_type,type,
p1: $i > $o ).
thf(p3_type,type,
p3: $i > $o ).
thf(p2_type,type,
p2: $i > $o ).
thf(1,conjecture,
~ ? [A: $i] :
~ ( ~ ! [B: $i] :
( ~ ( r1 @ A @ B )
| ~ ( p4 @ B ) )
| ~ ! [B: $i] :
( ~ ( r1 @ A @ B )
| ~ ( ~ ! [C: $i] :
( ~ ( r1 @ B @ C )
| ! [D: $i] :
( ~ ( r1 @ C @ D )
| ~ ! [E: $i] :
( ~ ( r1 @ D @ E )
| ~ ( p1 @ E ) ) ) )
& ! [C: $i] :
( ~ ( r1 @ B @ C )
| ~ ! [D: $i] :
( ~ ( r1 @ C @ D )
| ~ ( p1 @ D ) ) ) ) )
| ~ ! [B: $i] :
( ~ ( r1 @ A @ B )
| ~ ( ~ ! [C: $i] :
( ~ ( r1 @ B @ C )
| ~ ! [D: $i] :
( ~ ( r1 @ C @ D )
| ! [E: $i] :
( ~ ( r1 @ D @ E )
| ( p3 @ E ) )
| ~ ( p2 @ D ) ) )
| ~ ! [C: $i] :
( ~ ( r1 @ B @ C )
| ~ ( ~ ! [D: $i] :
( ~ ( r1 @ C @ D )
| ~ ( ! [E: $i] :
( ~ ( r1 @ D @ E )
| ( p3 @ E ) )
| ~ ( p2 @ D ) ) )
& ( p2 @ C )
& ~ ! [D: $i] :
( ~ ( r1 @ C @ D )
| ~ ! [E: $i] :
( ~ ( r1 @ D @ E )
| ~ ! [F: $i] :
( ~ ( r1 @ E @ F )
| ~ ( p2 @ F ) ) ) ) ) )
| ( ~ ! [C: $i] :
( ~ ( r1 @ B @ C )
| ! [D: $i] :
( ~ ( r1 @ C @ D )
| ~ ! [E: $i] :
( ~ ( r1 @ D @ E )
| ! [F: $i] :
( ~ ( r1 @ E @ F )
| ( p3 @ F ) )
| ~ ( p2 @ E ) ) ) )
& ! [C: $i] :
( ~ ( r1 @ B @ C )
| ~ ! [D: $i] :
( ~ ( r1 @ C @ D )
| ~ ( p2 @ D ) ) ) )
| ~ ! [C: $i] :
( ~ ( r1 @ B @ C )
| ~ ( ! [D: $i] :
( ~ ( r1 @ C @ D )
| ~ ! [E: $i] :
( ~ ( r1 @ D @ E )
| ~ ( p2 @ E ) ) )
& ! [D: $i] :
( ~ ( r1 @ C @ D )
| ~ ! [E: $i] :
( ~ ( r1 @ D @ E )
| ~ ! [F: $i] :
( ~ ( r1 @ E @ F )
| ! [G: $i] :
( ~ ( r1 @ F @ G )
| ( p3 @ G ) )
| ~ ( p2 @ F ) ) ) ) ) )
| ( ! [C: $i] :
( ~ ( r1 @ B @ C )
| ! [D: $i] :
( ~ ( r1 @ C @ D )
| ( p3 @ D ) )
| ~ ( p2 @ C ) )
& ! [C: $i] :
( ~ ( r1 @ B @ C )
| ~ ! [D: $i] :
( ~ ( r1 @ C @ D )
| ~ ( p2 @ D ) ) ) ) ) )
| ~ ! [B: $i] :
( ~ ( r1 @ A @ B )
| ~ ( ~ ! [C: $i] :
( ~ ( r1 @ B @ C )
| ! [D: $i] :
( ~ ( r1 @ C @ D )
| ( p1 @ D ) ) )
& ! [C: $i] :
( ~ ( r1 @ B @ C )
| ( p1 @ C ) ) ) )
| ! [B: $i] :
( ~ ( r1 @ A @ B )
| ! [C: $i] :
( ~ ( r1 @ B @ C )
| ~ ! [D: $i] :
( ~ ( r1 @ C @ D )
| ( p1 @ D ) ) )
| ! [C: $i] :
( ~ ( r1 @ B @ C )
| ( p1 @ C ) ) )
| ! [B: $i] :
( ~ ( r1 @ A @ B )
| ~ ! [C: $i] :
( ~ ( r1 @ B @ C )
| ~ ! [D: $i] :
( ~ ( r1 @ C @ D )
| ( p2 @ D ) ) ) )
| ~ ! [B: $i] :
( ~ ( r1 @ A @ B )
| ! [C: $i] :
( ~ ( r1 @ B @ C )
| ! [D: $i] :
( ~ ( r1 @ C @ D )
| ~ ( p1 @ D ) ) )
| ~ ! [C: $i] :
( ~ ( r1 @ B @ C )
| ~ ( p1 @ C ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',main) ).
thf(2,negated_conjecture,
~ ~ ? [A: $i] :
~ ( ~ ! [B: $i] :
( ~ ( r1 @ A @ B )
| ~ ( p4 @ B ) )
| ~ ! [B: $i] :
( ~ ( r1 @ A @ B )
| ~ ( ~ ! [C: $i] :
( ~ ( r1 @ B @ C )
| ! [D: $i] :
( ~ ( r1 @ C @ D )
| ~ ! [E: $i] :
( ~ ( r1 @ D @ E )
| ~ ( p1 @ E ) ) ) )
& ! [C: $i] :
( ~ ( r1 @ B @ C )
| ~ ! [D: $i] :
( ~ ( r1 @ C @ D )
| ~ ( p1 @ D ) ) ) ) )
| ~ ! [B: $i] :
( ~ ( r1 @ A @ B )
| ~ ( ~ ! [C: $i] :
( ~ ( r1 @ B @ C )
| ~ ! [D: $i] :
( ~ ( r1 @ C @ D )
| ! [E: $i] :
( ~ ( r1 @ D @ E )
| ( p3 @ E ) )
| ~ ( p2 @ D ) ) )
| ~ ! [C: $i] :
( ~ ( r1 @ B @ C )
| ~ ( ~ ! [D: $i] :
( ~ ( r1 @ C @ D )
| ~ ( ! [E: $i] :
( ~ ( r1 @ D @ E )
| ( p3 @ E ) )
| ~ ( p2 @ D ) ) )
& ( p2 @ C )
& ~ ! [D: $i] :
( ~ ( r1 @ C @ D )
| ~ ! [E: $i] :
( ~ ( r1 @ D @ E )
| ~ ! [F: $i] :
( ~ ( r1 @ E @ F )
| ~ ( p2 @ F ) ) ) ) ) )
| ( ~ ! [C: $i] :
( ~ ( r1 @ B @ C )
| ! [D: $i] :
( ~ ( r1 @ C @ D )
| ~ ! [E: $i] :
( ~ ( r1 @ D @ E )
| ! [F: $i] :
( ~ ( r1 @ E @ F )
| ( p3 @ F ) )
| ~ ( p2 @ E ) ) ) )
& ! [C: $i] :
( ~ ( r1 @ B @ C )
| ~ ! [D: $i] :
( ~ ( r1 @ C @ D )
| ~ ( p2 @ D ) ) ) )
| ~ ! [C: $i] :
( ~ ( r1 @ B @ C )
| ~ ( ! [D: $i] :
( ~ ( r1 @ C @ D )
| ~ ! [E: $i] :
( ~ ( r1 @ D @ E )
| ~ ( p2 @ E ) ) )
& ! [D: $i] :
( ~ ( r1 @ C @ D )
| ~ ! [E: $i] :
( ~ ( r1 @ D @ E )
| ~ ! [F: $i] :
( ~ ( r1 @ E @ F )
| ! [G: $i] :
( ~ ( r1 @ F @ G )
| ( p3 @ G ) )
| ~ ( p2 @ F ) ) ) ) ) )
| ( ! [C: $i] :
( ~ ( r1 @ B @ C )
| ! [D: $i] :
( ~ ( r1 @ C @ D )
| ( p3 @ D ) )
| ~ ( p2 @ C ) )
& ! [C: $i] :
( ~ ( r1 @ B @ C )
| ~ ! [D: $i] :
( ~ ( r1 @ C @ D )
| ~ ( p2 @ D ) ) ) ) ) )
| ~ ! [B: $i] :
( ~ ( r1 @ A @ B )
| ~ ( ~ ! [C: $i] :
( ~ ( r1 @ B @ C )
| ! [D: $i] :
( ~ ( r1 @ C @ D )
| ( p1 @ D ) ) )
& ! [C: $i] :
( ~ ( r1 @ B @ C )
| ( p1 @ C ) ) ) )
| ! [B: $i] :
( ~ ( r1 @ A @ B )
| ! [C: $i] :
( ~ ( r1 @ B @ C )
| ~ ! [D: $i] :
( ~ ( r1 @ C @ D )
| ( p1 @ D ) ) )
| ! [C: $i] :
( ~ ( r1 @ B @ C )
| ( p1 @ C ) ) )
| ! [B: $i] :
( ~ ( r1 @ A @ B )
| ~ ! [C: $i] :
( ~ ( r1 @ B @ C )
| ~ ! [D: $i] :
( ~ ( r1 @ C @ D )
| ( p2 @ D ) ) ) )
| ~ ! [B: $i] :
( ~ ( r1 @ A @ B )
| ! [C: $i] :
( ~ ( r1 @ B @ C )
| ! [D: $i] :
( ~ ( r1 @ C @ D )
| ~ ( p1 @ D ) ) )
| ~ ! [C: $i] :
( ~ ( r1 @ B @ C )
| ~ ( p1 @ C ) ) ) ),
inference(neg_conjecture,[status(cth)],[1]) ).
thf(3,plain,
~ ~ ? [A: $i] :
~ ( ~ ! [B: $i] :
( ~ ( r1 @ A @ B )
| ~ ( p4 @ B ) )
| ~ ! [B: $i] :
( ~ ( r1 @ A @ B )
| ~ ( ~ ! [C: $i] :
( ~ ( r1 @ B @ C )
| ! [D: $i] :
( ~ ( r1 @ C @ D )
| ~ ! [E: $i] :
( ~ ( r1 @ D @ E )
| ~ ( p1 @ E ) ) ) )
& ! [C: $i] :
( ~ ( r1 @ B @ C )
| ~ ! [D: $i] :
( ~ ( r1 @ C @ D )
| ~ ( p1 @ D ) ) ) ) )
| ~ ! [B: $i] :
( ~ ( r1 @ A @ B )
| ~ ( ~ ! [C: $i] :
( ~ ( r1 @ B @ C )
| ~ ! [D: $i] :
( ~ ( r1 @ C @ D )
| ! [E: $i] :
( ~ ( r1 @ D @ E )
| ( p3 @ E ) )
| ~ ( p2 @ D ) ) )
| ~ ! [C: $i] :
( ~ ( r1 @ B @ C )
| ~ ( ~ ! [D: $i] :
( ~ ( r1 @ C @ D )
| ~ ( ! [E: $i] :
( ~ ( r1 @ D @ E )
| ( p3 @ E ) )
| ~ ( p2 @ D ) ) )
& ( p2 @ C )
& ~ ! [D: $i] :
( ~ ( r1 @ C @ D )
| ~ ! [E: $i] :
( ~ ( r1 @ D @ E )
| ~ ! [F: $i] :
( ~ ( r1 @ E @ F )
| ~ ( p2 @ F ) ) ) ) ) )
| ( ~ ! [C: $i] :
( ~ ( r1 @ B @ C )
| ! [D: $i] :
( ~ ( r1 @ C @ D )
| ~ ! [E: $i] :
( ~ ( r1 @ D @ E )
| ! [F: $i] :
( ~ ( r1 @ E @ F )
| ( p3 @ F ) )
| ~ ( p2 @ E ) ) ) )
& ! [C: $i] :
( ~ ( r1 @ B @ C )
| ~ ! [D: $i] :
( ~ ( r1 @ C @ D )
| ~ ( p2 @ D ) ) ) )
| ~ ! [C: $i] :
( ~ ( r1 @ B @ C )
| ~ ( ! [D: $i] :
( ~ ( r1 @ C @ D )
| ~ ! [E: $i] :
( ~ ( r1 @ D @ E )
| ~ ( p2 @ E ) ) )
& ! [D: $i] :
( ~ ( r1 @ C @ D )
| ~ ! [E: $i] :
( ~ ( r1 @ D @ E )
| ~ ! [F: $i] :
( ~ ( r1 @ E @ F )
| ! [G: $i] :
( ~ ( r1 @ F @ G )
| ( p3 @ G ) )
| ~ ( p2 @ F ) ) ) ) ) )
| ( ! [C: $i] :
( ~ ( r1 @ B @ C )
| ! [D: $i] :
( ~ ( r1 @ C @ D )
| ( p3 @ D ) )
| ~ ( p2 @ C ) )
& ! [C: $i] :
( ~ ( r1 @ B @ C )
| ~ ! [D: $i] :
( ~ ( r1 @ C @ D )
| ~ ( p2 @ D ) ) ) ) ) )
| ~ ! [B: $i] :
( ~ ( r1 @ A @ B )
| ~ ( ~ ! [C: $i] :
( ~ ( r1 @ B @ C )
| ! [D: $i] :
( ~ ( r1 @ C @ D )
| ( p1 @ D ) ) )
& ! [C: $i] :
( ~ ( r1 @ B @ C )
| ( p1 @ C ) ) ) )
| ! [B: $i] :
( ~ ( r1 @ A @ B )
| ! [C: $i] :
( ~ ( r1 @ B @ C )
| ~ ! [D: $i] :
( ~ ( r1 @ C @ D )
| ( p1 @ D ) ) )
| ! [C: $i] :
( ~ ( r1 @ B @ C )
| ( p1 @ C ) ) )
| ! [B: $i] :
( ~ ( r1 @ A @ B )
| ~ ! [C: $i] :
( ~ ( r1 @ B @ C )
| ~ ! [D: $i] :
( ~ ( r1 @ C @ D )
| ( p2 @ D ) ) ) )
| ~ ! [B: $i] :
( ~ ( r1 @ A @ B )
| ! [C: $i] :
( ~ ( r1 @ B @ C )
| ! [D: $i] :
( ~ ( r1 @ C @ D )
| ~ ( p1 @ D ) ) )
| ~ ! [C: $i] :
( ~ ( r1 @ B @ C )
| ~ ( p1 @ C ) ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).
thf(268,plain,
$false,
inference(e,[status(thm)],[3]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : LCL652+1.001 : TPTP v8.1.2. Released v4.0.0.
% 0.12/0.15 % Command : run_Leo-III %s %d
% 0.15/0.36 % Computer : n016.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.37 % CPULimit : 300
% 0.15/0.37 % WCLimit : 300
% 0.15/0.37 % DateTime : Thu May 18 16:39:42 EDT 2023
% 0.15/0.37 % CPUTime :
% 1.00/0.90 % [INFO] Parsing problem /export/starexec/sandbox2/benchmark/theBenchmark.p ...
% 1.26/1.05 % [INFO] Parsing done (155ms).
% 1.26/1.07 % [INFO] Running in sequential loop mode.
% 1.79/1.28 % [INFO] eprover registered as external prover.
% 1.79/1.28 % [INFO] cvc4 registered as external prover.
% 1.79/1.28 % [INFO] Scanning for conjecture ...
% 2.01/1.38 % [INFO] Found a conjecture and 0 axioms. Running axiom selection ...
% 2.16/1.41 % [INFO] Axiom selection finished. Selected 0 axioms (removed 0 axioms).
% 2.16/1.41 % [INFO] Problem is first-order (TPTP FOF).
% 2.16/1.42 % [INFO] Type checking passed.
% 2.16/1.42 % [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 ...
% 5.30/2.37 % External prover 'e' found a proof!
% 5.30/2.37 % [INFO] Killing All external provers ...
% 5.30/2.38 % Time passed: 1832ms (effective reasoning time: 1305ms)
% 5.30/2.38 % 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)>
% 5.30/2.38 % Axioms used in derivation (0):
% 5.30/2.38 % No. of inferences in proof: 4
% 5.30/2.38 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p : 1832 ms resp. 1305 ms w/o parsing
% 5.40/2.42 % SZS output start Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 5.40/2.42 % [INFO] Killing All external provers ...
%------------------------------------------------------------------------------