TSTP Solution File: LCL656+1.001 by Leo-III---1.7.7
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Leo-III---1.7.7
% Problem : LCL656+1.001 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_Leo-III %s %d
% Computer : n003.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:31:00 EDT 2023
% Result : Theorem 3.05s 1.70s
% Output : Refutation 3.30s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 8
% Syntax : Number of formulae : 12 ( 3 unt; 6 typ; 0 def)
% Number of atoms : 114 ( 0 equ; 0 cnn)
% Maximal formula atoms : 37 ( 19 avg)
% Number of connectives : 351 ( 104 ~; 66 |; 42 &; 139 @)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 21 ( 12 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 : 29 ( 0 ^; 26 !; 3 ?; 29 :)
% 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 ) ) ) )
& ~ ( p101 @ A )
& ( p100 @ A ) ) ),
file('/export/starexec/sandbox2/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 ) ) ) )
& ~ ( p101 @ A )
& ( p100 @ A ) ) ),
inference(neg_conjecture,[status(cth)],[1]) ).
thf(4,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 ) ) ) )
& ~ ( p101 @ A )
& ( p100 @ A ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).
thf(3,axiom,
! [A: $i] : ( r1 @ A @ A ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',reflexivity) ).
thf(38,plain,
! [A: $i] : ( r1 @ A @ A ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[3]) ).
thf(40,plain,
$false,
inference(cvc4,[status(thm)],[4,38]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : LCL656+1.001 : TPTP v8.1.2. Released v4.0.0.
% 0.14/0.15 % Command : run_Leo-III %s %d
% 0.16/0.36 % Computer : n003.cluster.edu
% 0.16/0.36 % Model : x86_64 x86_64
% 0.16/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.36 % Memory : 8042.1875MB
% 0.16/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.36 % CPULimit : 300
% 0.16/0.36 % WCLimit : 300
% 0.16/0.36 % DateTime : Thu May 18 15:59:16 EDT 2023
% 0.16/0.36 % CPUTime :
% 0.96/0.89 % [INFO] Parsing problem /export/starexec/sandbox2/benchmark/theBenchmark.p ...
% 1.15/1.02 % [INFO] Parsing done (130ms).
% 1.15/1.03 % [INFO] Running in sequential loop mode.
% 1.73/1.23 % [INFO] eprover registered as external prover.
% 1.73/1.23 % [INFO] cvc4 registered as external prover.
% 1.73/1.23 % [INFO] Scanning for conjecture ...
% 1.80/1.30 % [INFO] Found a conjecture and 1 axioms. Running axiom selection ...
% 2.04/1.33 % [INFO] Axiom selection finished. Selected 1 axioms (removed 0 axioms).
% 2.04/1.34 % [INFO] Problem is first-order (TPTP FOF).
% 2.04/1.34 % [INFO] Type checking passed.
% 2.04/1.34 % [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.05/1.69 % External prover 'cvc4' found a proof!
% 3.05/1.69 % [INFO] Killing All external provers ...
% 3.05/1.69 % Time passed: 1183ms (effective reasoning time: 665ms)
% 3.05/1.70 % 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.05/1.70 % Axioms used in derivation (1): reflexivity
% 3.05/1.70 % No. of inferences in proof: 6
% 3.05/1.70 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p : 1183 ms resp. 665 ms w/o parsing
% 3.30/1.77 % SZS output start Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 3.30/1.77 % [INFO] Killing All external provers ...
%------------------------------------------------------------------------------