TSTP Solution File: NLP001+1 by Leo-III---1.7.7
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Leo-III---1.7.7
% Problem : NLP001+1 : TPTP v8.1.2. Released v2.4.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 : Fri May 19 11:35:57 EDT 2023
% Result : Theorem 2.92s 1.65s
% Output : Refutation 3.29s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 15
% Syntax : Number of formulae : 18 ( 1 unt; 14 typ; 0 def)
% Number of atoms : 169 ( 0 equ; 0 cnn)
% Maximal formula atoms : 56 ( 42 avg)
% Number of connectives : 371 ( 2 ~; 0 |; 159 &; 204 @)
% ( 0 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 23 ( 17 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 17 ( 17 >; 0 *; 0 +; 0 <<)
% Number of symbols : 15 ( 14 usr; 1 con; 0-2 aty)
% Number of variables : 48 ( 0 ^; 0 !; 48 ?; 48 :)
% Comments :
%------------------------------------------------------------------------------
thf(hollywood_type,type,
hollywood: $i > $o ).
thf(city_type,type,
city: $i > $o ).
thf(event_type,type,
event: $i > $o ).
thf(street_type,type,
street: $i > $o ).
thf(way_type,type,
way: $i > $o ).
thf(lonely_type,type,
lonely: $i > $o ).
thf(chevy_type,type,
chevy: $i > $o ).
thf(car_type,type,
car: $i > $o ).
thf(white_type,type,
white: $i > $o ).
thf(dirty_type,type,
dirty: $i > $o ).
thf(old_type,type,
old: $i > $o ).
thf(barrel_type,type,
barrel: $i > $i > $o ).
thf(down_type,type,
down: $i > $i > $o ).
thf(in_type,type,
in: $i > $i > $o ).
thf(1,conjecture,
( ( ? [A: $i,B: $i,C: $i,D: $i] :
( ( hollywood @ A )
& ( city @ A )
& ( event @ B )
& ( street @ C )
& ( way @ C )
& ( lonely @ C )
& ( chevy @ D )
& ( car @ D )
& ( white @ D )
& ( dirty @ D )
& ( old @ D )
& ( barrel @ B @ D )
& ( down @ B @ C )
& ( in @ B @ A ) )
=> ? [A: $i,B: $i,C: $i,D: $i] :
( ( hollywood @ A )
& ( city @ A )
& ( event @ B )
& ( chevy @ C )
& ( car @ C )
& ( white @ C )
& ( dirty @ C )
& ( old @ C )
& ( street @ D )
& ( way @ D )
& ( lonely @ D )
& ( barrel @ B @ C )
& ( down @ B @ D )
& ( in @ B @ A ) ) )
& ( ? [A: $i,B: $i,C: $i,D: $i] :
( ( hollywood @ A )
& ( city @ A )
& ( event @ B )
& ( chevy @ C )
& ( car @ C )
& ( white @ C )
& ( dirty @ C )
& ( old @ C )
& ( street @ D )
& ( way @ D )
& ( lonely @ D )
& ( barrel @ B @ C )
& ( down @ B @ D )
& ( in @ B @ A ) )
=> ? [A: $i,B: $i,C: $i,D: $i] :
( ( hollywood @ A )
& ( city @ A )
& ( event @ B )
& ( street @ C )
& ( way @ C )
& ( lonely @ C )
& ( chevy @ D )
& ( car @ D )
& ( white @ D )
& ( dirty @ D )
& ( old @ D )
& ( barrel @ B @ D )
& ( down @ B @ C )
& ( in @ B @ A ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).
thf(2,negated_conjecture,
~ ( ( ? [A: $i,B: $i,C: $i,D: $i] :
( ( hollywood @ A )
& ( city @ A )
& ( event @ B )
& ( street @ C )
& ( way @ C )
& ( lonely @ C )
& ( chevy @ D )
& ( car @ D )
& ( white @ D )
& ( dirty @ D )
& ( old @ D )
& ( barrel @ B @ D )
& ( down @ B @ C )
& ( in @ B @ A ) )
=> ? [A: $i,B: $i,C: $i,D: $i] :
( ( hollywood @ A )
& ( city @ A )
& ( event @ B )
& ( chevy @ C )
& ( car @ C )
& ( white @ C )
& ( dirty @ C )
& ( old @ C )
& ( street @ D )
& ( way @ D )
& ( lonely @ D )
& ( barrel @ B @ C )
& ( down @ B @ D )
& ( in @ B @ A ) ) )
& ( ? [A: $i,B: $i,C: $i,D: $i] :
( ( hollywood @ A )
& ( city @ A )
& ( event @ B )
& ( chevy @ C )
& ( car @ C )
& ( white @ C )
& ( dirty @ C )
& ( old @ C )
& ( street @ D )
& ( way @ D )
& ( lonely @ D )
& ( barrel @ B @ C )
& ( down @ B @ D )
& ( in @ B @ A ) )
=> ? [A: $i,B: $i,C: $i,D: $i] :
( ( hollywood @ A )
& ( city @ A )
& ( event @ B )
& ( street @ C )
& ( way @ C )
& ( lonely @ C )
& ( chevy @ D )
& ( car @ D )
& ( white @ D )
& ( dirty @ D )
& ( old @ D )
& ( barrel @ B @ D )
& ( down @ B @ C )
& ( in @ B @ A ) ) ) ),
inference(neg_conjecture,[status(cth)],[1]) ).
thf(3,plain,
~ ( ( ? [A: $i,B: $i,C: $i,D: $i] :
( ( hollywood @ A )
& ( city @ A )
& ( event @ B )
& ( street @ C )
& ( way @ C )
& ( lonely @ C )
& ( chevy @ D )
& ( car @ D )
& ( white @ D )
& ( dirty @ D )
& ( old @ D )
& ( barrel @ B @ D )
& ( down @ B @ C )
& ( in @ B @ A ) )
=> ? [A: $i,B: $i,C: $i,D: $i] :
( ( hollywood @ A )
& ( city @ A )
& ( event @ B )
& ( chevy @ C )
& ( car @ C )
& ( white @ C )
& ( dirty @ C )
& ( old @ C )
& ( street @ D )
& ( way @ D )
& ( lonely @ D )
& ( barrel @ B @ C )
& ( down @ B @ D )
& ( in @ B @ A ) ) )
& ( ? [A: $i,B: $i,C: $i,D: $i] :
( ( hollywood @ A )
& ( city @ A )
& ( event @ B )
& ( chevy @ C )
& ( car @ C )
& ( white @ C )
& ( dirty @ C )
& ( old @ C )
& ( street @ D )
& ( way @ D )
& ( lonely @ D )
& ( barrel @ B @ C )
& ( down @ B @ D )
& ( in @ B @ A ) )
=> ? [A: $i,B: $i,C: $i,D: $i] :
( ( hollywood @ A )
& ( city @ A )
& ( event @ B )
& ( street @ C )
& ( way @ C )
& ( lonely @ C )
& ( chevy @ D )
& ( car @ D )
& ( white @ D )
& ( dirty @ D )
& ( old @ D )
& ( barrel @ B @ D )
& ( down @ B @ C )
& ( in @ B @ A ) ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).
thf(36,plain,
$false,
inference(cvc4,[status(thm)],[3]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : NLP001+1 : TPTP v8.1.2. Released v2.4.0.
% 0.11/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.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Thu May 18 14:55:10 EDT 2023
% 0.14/0.35 % CPUTime :
% 0.85/0.83 % [INFO] Parsing problem /export/starexec/sandbox/benchmark/theBenchmark.p ...
% 1.23/0.95 % [INFO] Parsing done (116ms).
% 1.23/0.95 % [INFO] Running in sequential loop mode.
% 1.54/1.15 % [INFO] eprover registered as external prover.
% 1.54/1.15 % [INFO] cvc4 registered as external prover.
% 1.54/1.15 % [INFO] Scanning for conjecture ...
% 1.73/1.23 % [INFO] Found a conjecture and 0 axioms. Running axiom selection ...
% 1.73/1.26 % [INFO] Axiom selection finished. Selected 0 axioms (removed 0 axioms).
% 1.73/1.26 % [INFO] Problem is first-order (TPTP FOF).
% 1.73/1.27 % [INFO] Type checking passed.
% 1.73/1.27 % [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 ...
% 2.92/1.65 % External prover 'cvc4' found a proof!
% 2.92/1.65 % [INFO] Killing All external provers ...
% 2.92/1.65 % Time passed: 1141ms (effective reasoning time: 693ms)
% 2.92/1.65 % 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)>
% 2.92/1.65 % Axioms used in derivation (0):
% 2.92/1.65 % No. of inferences in proof: 4
% 2.92/1.65 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p : 1141 ms resp. 693 ms w/o parsing
% 3.29/1.73 % SZS output start Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 3.29/1.73 % [INFO] Killing All external provers ...
%------------------------------------------------------------------------------