%------------------------------------------------------------------------------
% File : Leo-III---1.8.0
% Problem : NLP007+1 : TPTP v9.3.1. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : java -Xss128m -Xmx2g -Xms1g -jar /export/starexec/sandbox/solver/bin/leo3.jar /export/starexec/sandbox/benchmark/theBenchmark.p -t 300 -p --atp eprover=/export/starexec/sandbox/solver/bin/externals/eprover --instantiate 39
% Computer : n014.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Sun Sep 27 08:04:36 AM UTC 2026
% Result : Theorem 6.48s 3.26s
% Output : Refutation 6.97s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 1
% Syntax : Number of formulae : 4 ( 1 unt; 0 typ; 0 def)
% Number of atoms : 373 ( 36 equ; 0 cnn)
% Maximal formula atoms : 124 ( 93 avg)
% Number of connectives : 779 ( 14 ~; 0 |; 363 &; 396 @)
% ( 0 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 46 ( 35 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of symbols : 22 ( 20 usr; 1 con; 0-2 aty)
% Number of variables : 120 ( 0 ^; 0 !; 120 ?; 120 :)
% Comments :
%------------------------------------------------------------------------------
thf(seat_decl,type,
seat: $i > $o ).
thf(furniture_decl,type,
furniture: $i > $o ).
thf(front_decl,type,
front: $i > $o ).
thf(hollywood_decl,type,
hollywood: $i > $o ).
thf(city_decl,type,
city: $i > $o ).
thf(event_decl,type,
event: $i > $o ).
thf(chevy_decl,type,
chevy: $i > $o ).
thf(car_decl,type,
car: $i > $o ).
thf(white_decl,type,
white: $i > $o ).
thf(dirty_decl,type,
dirty: $i > $o ).
thf(old_decl,type,
old: $i > $o ).
thf(street_decl,type,
street: $i > $o ).
thf(way_decl,type,
way: $i > $o ).
thf(lonely_decl,type,
lonely: $i > $o ).
thf(barrel_decl,type,
barrel: $i > $i > $o ).
thf(down_decl,type,
down: $i > $i > $o ).
thf(in_decl,type,
in: $i > $i > $o ).
thf(fellow_decl,type,
fellow: $i > $o ).
thf(man_decl,type,
man: $i > $o ).
thf(young_decl,type,
young: $i > $o ).
thf(1,conjecture,
( ( ? [A: $i,B: $i,C: $i,D: $i,E: $i,F: $i,G: $i,H: $i,I: $i,J: $i] :
( ( H @ ( J @ in ) )
& ( G = J )
& ( A @ ( I @ in ) )
& ( F = I )
& ( G @ young )
& ( G @ man )
& ( G @ fellow )
& ( F @ young )
& ( F @ man )
& ( F @ fellow )
& ( F != G )
& ( H @ front )
& ( H @ furniture )
& ( H @ seat )
& ( B @ ( C @ in ) )
& ( E @ ( C @ down ) )
& ( D @ ( C @ barrel ) )
& ( E @ lonely )
& ( E @ way )
& ( E @ street )
& ( D @ old )
& ( D @ dirty )
& ( D @ white )
& ( D @ car )
& ( D @ chevy )
& ( C @ event )
& ( B @ city )
& ( B @ hollywood )
& ( A @ front )
& ( A @ furniture )
& ( A @ seat ) )
=> ? [A: $i,B: $i,C: $i,D: $i,E: $i,F: $i,G: $i,H: $i,I: $i,J: $i] :
( ( A @ ( J @ in ) )
& ( G = J )
& ( H @ ( I @ in ) )
& ( F = I )
& ( G @ young )
& ( G @ man )
& ( G @ fellow )
& ( F @ young )
& ( F @ man )
& ( F @ fellow )
& ( F != G )
& ( H @ front )
& ( H @ furniture )
& ( H @ seat )
& ( B @ ( C @ in ) )
& ( E @ ( C @ down ) )
& ( D @ ( C @ barrel ) )
& ( E @ lonely )
& ( E @ way )
& ( E @ street )
& ( D @ old )
& ( D @ dirty )
& ( D @ white )
& ( D @ car )
& ( D @ chevy )
& ( C @ event )
& ( B @ city )
& ( B @ hollywood )
& ( A @ front )
& ( A @ furniture )
& ( A @ seat ) ) )
& ( ? [A: $i,B: $i,C: $i,D: $i,E: $i,F: $i,G: $i,H: $i,I: $i,J: $i] :
( ( A @ ( J @ in ) )
& ( G = J )
& ( H @ ( I @ in ) )
& ( F = I )
& ( G @ young )
& ( G @ man )
& ( G @ fellow )
& ( F @ young )
& ( F @ man )
& ( F @ fellow )
& ( F != G )
& ( H @ front )
& ( H @ furniture )
& ( H @ seat )
& ( B @ ( C @ in ) )
& ( E @ ( C @ down ) )
& ( D @ ( C @ barrel ) )
& ( E @ lonely )
& ( E @ way )
& ( E @ street )
& ( D @ old )
& ( D @ dirty )
& ( D @ white )
& ( D @ car )
& ( D @ chevy )
& ( C @ event )
& ( B @ city )
& ( B @ hollywood )
& ( A @ front )
& ( A @ furniture )
& ( A @ seat ) )
=> ? [A: $i,B: $i,C: $i,D: $i,E: $i,F: $i,G: $i,H: $i,I: $i,J: $i] :
( ( H @ ( J @ in ) )
& ( G = J )
& ( A @ ( I @ in ) )
& ( F = I )
& ( G @ young )
& ( G @ man )
& ( G @ fellow )
& ( F @ young )
& ( F @ man )
& ( F @ fellow )
& ( F != G )
& ( H @ front )
& ( H @ furniture )
& ( H @ seat )
& ( B @ ( C @ in ) )
& ( E @ ( C @ down ) )
& ( D @ ( C @ barrel ) )
& ( E @ lonely )
& ( E @ way )
& ( E @ street )
& ( D @ old )
& ( D @ dirty )
& ( D @ white )
& ( D @ car )
& ( D @ chevy )
& ( C @ event )
& ( B @ city )
& ( B @ hollywood )
& ( A @ front )
& ( A @ furniture )
& ( A @ seat ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).
thf(2,negated_conjecture,
~ ( ( ? [A: $i,B: $i,C: $i,D: $i,E: $i,F: $i,G: $i,H: $i,I: $i,J: $i] :
( ( H @ ( J @ in ) )
& ( G = J )
& ( A @ ( I @ in ) )
& ( F = I )
& ( G @ young )
& ( G @ man )
& ( G @ fellow )
& ( F @ young )
& ( F @ man )
& ( F @ fellow )
& ( F != G )
& ( H @ front )
& ( H @ furniture )
& ( H @ seat )
& ( B @ ( C @ in ) )
& ( E @ ( C @ down ) )
& ( D @ ( C @ barrel ) )
& ( E @ lonely )
& ( E @ way )
& ( E @ street )
& ( D @ old )
& ( D @ dirty )
& ( D @ white )
& ( D @ car )
& ( D @ chevy )
& ( C @ event )
& ( B @ city )
& ( B @ hollywood )
& ( A @ front )
& ( A @ furniture )
& ( A @ seat ) )
=> ? [A: $i,B: $i,C: $i,D: $i,E: $i,F: $i,G: $i,H: $i,I: $i,J: $i] :
( ( A @ ( J @ in ) )
& ( G = J )
& ( H @ ( I @ in ) )
& ( F = I )
& ( G @ young )
& ( G @ man )
& ( G @ fellow )
& ( F @ young )
& ( F @ man )
& ( F @ fellow )
& ( F != G )
& ( H @ front )
& ( H @ furniture )
& ( H @ seat )
& ( B @ ( C @ in ) )
& ( E @ ( C @ down ) )
& ( D @ ( C @ barrel ) )
& ( E @ lonely )
& ( E @ way )
& ( E @ street )
& ( D @ old )
& ( D @ dirty )
& ( D @ white )
& ( D @ car )
& ( D @ chevy )
& ( C @ event )
& ( B @ city )
& ( B @ hollywood )
& ( A @ front )
& ( A @ furniture )
& ( A @ seat ) ) )
& ( ? [A: $i,B: $i,C: $i,D: $i,E: $i,F: $i,G: $i,H: $i,I: $i,J: $i] :
( ( A @ ( J @ in ) )
& ( G = J )
& ( H @ ( I @ in ) )
& ( F = I )
& ( G @ young )
& ( G @ man )
& ( G @ fellow )
& ( F @ young )
& ( F @ man )
& ( F @ fellow )
& ( F != G )
& ( H @ front )
& ( H @ furniture )
& ( H @ seat )
& ( B @ ( C @ in ) )
& ( E @ ( C @ down ) )
& ( D @ ( C @ barrel ) )
& ( E @ lonely )
& ( E @ way )
& ( E @ street )
& ( D @ old )
& ( D @ dirty )
& ( D @ white )
& ( D @ car )
& ( D @ chevy )
& ( C @ event )
& ( B @ city )
& ( B @ hollywood )
& ( A @ front )
& ( A @ furniture )
& ( A @ seat ) )
=> ? [A: $i,B: $i,C: $i,D: $i,E: $i,F: $i,G: $i,H: $i,I: $i,J: $i] :
( ( H @ ( J @ in ) )
& ( G = J )
& ( A @ ( I @ in ) )
& ( F = I )
& ( G @ young )
& ( G @ man )
& ( G @ fellow )
& ( F @ young )
& ( F @ man )
& ( F @ fellow )
& ( F != G )
& ( H @ front )
& ( H @ furniture )
& ( H @ seat )
& ( B @ ( C @ in ) )
& ( E @ ( C @ down ) )
& ( D @ ( C @ barrel ) )
& ( E @ lonely )
& ( E @ way )
& ( E @ street )
& ( D @ old )
& ( D @ dirty )
& ( D @ white )
& ( D @ car )
& ( D @ chevy )
& ( C @ event )
& ( B @ city )
& ( B @ hollywood )
& ( A @ front )
& ( A @ furniture )
& ( A @ seat ) ) ) ),
inference(neg_conjecture,[status(cth)],[1]) ).
thf(3,plain,
~ ( ( ? [A: $i,B: $i,C: $i,D: $i,E: $i,F: $i,G: $i,H: $i,I: $i,J: $i] :
( ( H @ ( J @ in ) )
& ( G = J )
& ( A @ ( I @ in ) )
& ( F = I )
& ( G @ young )
& ( G @ man )
& ( G @ fellow )
& ( F @ young )
& ( F @ man )
& ( F @ fellow )
& ( F != G )
& ( H @ front )
& ( H @ furniture )
& ( H @ seat )
& ( B @ ( C @ in ) )
& ( E @ ( C @ down ) )
& ( D @ ( C @ barrel ) )
& ( E @ lonely )
& ( E @ way )
& ( E @ street )
& ( D @ old )
& ( D @ dirty )
& ( D @ white )
& ( D @ car )
& ( D @ chevy )
& ( C @ event )
& ( B @ city )
& ( B @ hollywood )
& ( A @ front )
& ( A @ furniture )
& ( A @ seat ) )
=> ? [A: $i,B: $i,C: $i,D: $i,E: $i,F: $i,G: $i,H: $i,I: $i,J: $i] :
( ( A @ ( J @ in ) )
& ( G = J )
& ( H @ ( I @ in ) )
& ( F = I )
& ( G @ young )
& ( G @ man )
& ( G @ fellow )
& ( F @ young )
& ( F @ man )
& ( F @ fellow )
& ( F != G )
& ( H @ front )
& ( H @ furniture )
& ( H @ seat )
& ( B @ ( C @ in ) )
& ( E @ ( C @ down ) )
& ( D @ ( C @ barrel ) )
& ( E @ lonely )
& ( E @ way )
& ( E @ street )
& ( D @ old )
& ( D @ dirty )
& ( D @ white )
& ( D @ car )
& ( D @ chevy )
& ( C @ event )
& ( B @ city )
& ( B @ hollywood )
& ( A @ front )
& ( A @ furniture )
& ( A @ seat ) ) )
& ( ? [A: $i,B: $i,C: $i,D: $i,E: $i,F: $i,G: $i,H: $i,I: $i,J: $i] :
( ( A @ ( J @ in ) )
& ( G = J )
& ( H @ ( I @ in ) )
& ( F = I )
& ( G @ young )
& ( G @ man )
& ( G @ fellow )
& ( F @ young )
& ( F @ man )
& ( F @ fellow )
& ( F != G )
& ( H @ front )
& ( H @ furniture )
& ( H @ seat )
& ( B @ ( C @ in ) )
& ( E @ ( C @ down ) )
& ( D @ ( C @ barrel ) )
& ( E @ lonely )
& ( E @ way )
& ( E @ street )
& ( D @ old )
& ( D @ dirty )
& ( D @ white )
& ( D @ car )
& ( D @ chevy )
& ( C @ event )
& ( B @ city )
& ( B @ hollywood )
& ( A @ front )
& ( A @ furniture )
& ( A @ seat ) )
=> ? [A: $i,B: $i,C: $i,D: $i,E: $i,F: $i,G: $i,H: $i,I: $i,J: $i] :
( ( H @ ( J @ in ) )
& ( G = J )
& ( A @ ( I @ in ) )
& ( F = I )
& ( G @ young )
& ( G @ man )
& ( G @ fellow )
& ( F @ young )
& ( F @ man )
& ( F @ fellow )
& ( F != G )
& ( H @ front )
& ( H @ furniture )
& ( H @ seat )
& ( B @ ( C @ in ) )
& ( E @ ( C @ down ) )
& ( D @ ( C @ barrel ) )
& ( E @ lonely )
& ( E @ way )
& ( E @ street )
& ( D @ old )
& ( D @ dirty )
& ( D @ white )
& ( D @ car )
& ( D @ chevy )
& ( C @ event )
& ( B @ city )
& ( B @ hollywood )
& ( A @ front )
& ( A @ furniture )
& ( A @ seat ) ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).
thf(139,plain,
$false,
inference(e,[status(thm)],[3]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : NLP007+1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.07 % Command : java -Xss128m -Xmx2g -Xms1g -jar /export/starexec/sandbox/solver/bin/leo3.jar /export/starexec/sandbox/benchmark/theBenchmark.p -t 300 -p --atp eprover=/export/starexec/sandbox/solver/bin/externals/eprover --instantiate 39
% 0.13/0.39 % Computer : n014.cluster.edu
% 0.13/0.39 % Model : x86_64 x86_64
% 0.13/0.39 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.39 % Memory : 8046.5625MB
% 0.13/0.39 % OS : Linux 6.8.0-71-generic
% 0.13/0.40 % CPULimit : 300
% 0.13/0.40 % WCLimit : 300
% 0.13/0.40 % DateTime : Sat Sep 26 00:22:46 UTC 2026
% 0.13/0.40 % CPUTime :
% 0.13/0.40 Running java -Xss128m -Xmx2g -Xms1g -jar /export/starexec/sandbox/solver/bin/leo3.jar /export/starexec/sandbox/benchmark/theBenchmark.p -t 300 -p --atp eprover=/export/starexec/sandbox/solver/bin/externals/eprover --instantiate 39
% 0.84/0.98 % [INFO] Parsing problem /export/starexec/sandbox/benchmark/theBenchmark.p ...
% 1.20/1.16 % [INFO] Parsing done (181ms).
% 1.20/1.18 % [INFO] Running in sequential loop mode.
% 1.81/1.58 % [INFO] eprover registered as external prover.
% 1.81/1.59 % [INFO] Scanning for conjecture ...
% 2.19/1.77 % [INFO] Found a conjecture (or negated_conjecture) and 0 axioms. Running axiom selection ...
% 2.35/1.83 % [INFO] Axiom selection finished. Selected 0 axioms (removed 0 axioms).
% 2.35/1.83 % [INFO] Problem is first-order (TPTP FOF).
% 2.35/1.84 % [INFO] Type checking passed.
% 2.35/1.84 % [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 ...
% 6.48/3.26 % External prover 'e' found a proof!
% 6.48/3.26 % [INFO] Killing All external provers ...
% 6.48/3.26 % Time passed: 2716ms (effective reasoning time: 2079ms)
% 6.48/3.26 % 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)>
% 6.48/3.26 % Axioms used in derivation (0):
% 6.48/3.26 % No. of inferences in proof: 4
% 6.48/3.26 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p : 2716 ms resp. 2079 ms w/o parsing
% 6.97/3.31 % SZS output start Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 6.97/3.31 % [INFO] Killing All external provers ...
%------------------------------------------------------------------------------