%------------------------------------------------------------------------------
% File : Leo-III---1.8.0
% Problem : PUZ129+2 : TPTP v9.3.1. Released v4.0.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 : n008.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:21:24 AM UTC 2026
% Result : Theorem 3.97s 2.47s
% Output : Refutation 4.25s
% 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 : 109 ( 30 equ; 0 cnn)
% Maximal formula atoms : 36 ( 27 avg)
% Number of connectives : 275 ( 14 ~; 0 |; 72 &; 156 @)
% ( 0 <=>; 33 =>; 0 <=; 0 <~>)
% Maximal formula depth : 18 ( 14 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of symbols : 12 ( 10 usr; 7 con; 0-3 aty)
% Number of variables : 60 ( 0 ^; 30 !; 30 ?; 60 :)
% Comments :
%------------------------------------------------------------------------------
thf(person_decl,type,
person: $i > $o ).
thf(property1_decl,type,
property1: $i > $i > $i > $o ).
thf(honest_decl,type,
honest: $i ).
thf(pos_decl,type,
pos: $i ).
thf(industrious_decl,type,
industrious: $i ).
thf(healthy_decl,type,
healthy: $i ).
thf(grocer_decl,type,
grocer: $i > $o ).
thf(cyclist_decl,type,
cyclist: $i > $o ).
thf(unhealthy_decl,type,
unhealthy: $i ).
thf(dishonest_decl,type,
dishonest: $i ).
thf(1,conjecture,
( ( ! [A: $i] :
( ( A @ cyclist )
=> ? [B: $i] :
( ( A = B )
& ( B @ person ) ) )
& ! [A: $i] :
( ( A @ grocer )
=> ? [B: $i] :
( ( A = B )
& ( B @ person ) ) )
& ! [A: $i] :
( ( ( pos @ ( honest @ ( A @ property1 ) ) )
& ( A @ person ) )
=> ~ ? [B: $i] :
( ( A = B )
& ( pos @ ( dishonest @ ( B @ property1 ) ) ) ) )
& ! [A: $i] :
( ( ( pos @ ( healthy @ ( A @ property1 ) ) )
& ( A @ person ) )
=> ~ ? [B: $i] :
( ( A = B )
& ( pos @ ( unhealthy @ ( B @ property1 ) ) ) ) )
& ! [A: $i] :
( ( ( pos @ ( unhealthy @ ( A @ property1 ) ) )
& ( A @ cyclist ) )
=> ? [B: $i] :
( ( A = B )
& ( pos @ ( dishonest @ ( B @ property1 ) ) ) ) )
& ! [A: $i] :
( ( A @ cyclist )
=> ? [B: $i] :
( ( A = B )
& ( pos @ ( industrious @ ( B @ property1 ) ) ) ) )
& ! [A: $i] :
( ( ( pos @ ( industrious @ ( A @ property1 ) ) )
& ( A @ grocer ) )
=> ? [B: $i] :
( ( A = B )
& ( pos @ ( honest @ ( B @ property1 ) ) ) ) )
& ! [A: $i] :
( ( A @ grocer )
=> ~ ? [B: $i] :
( ( A = B )
& ( pos @ ( healthy @ ( B @ property1 ) ) ) ) )
& ! [A: $i] :
( ( ( pos @ ( industrious @ ( A @ property1 ) ) )
& ( pos @ ( honest @ ( A @ property1 ) ) )
& ( A @ person ) )
=> ? [B: $i] :
( ( A = B )
& ( pos @ ( healthy @ ( B @ property1 ) ) ) ) ) )
=> ! [A: $i] :
( ( A @ grocer )
=> ~ ? [B: $i] :
( ( A = B )
& ( B @ cyclist ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove) ).
thf(2,negated_conjecture,
~ ( ( ! [A: $i] :
( ( A @ cyclist )
=> ? [B: $i] :
( ( A = B )
& ( B @ person ) ) )
& ! [A: $i] :
( ( A @ grocer )
=> ? [B: $i] :
( ( A = B )
& ( B @ person ) ) )
& ! [A: $i] :
( ( ( pos @ ( honest @ ( A @ property1 ) ) )
& ( A @ person ) )
=> ~ ? [B: $i] :
( ( A = B )
& ( pos @ ( dishonest @ ( B @ property1 ) ) ) ) )
& ! [A: $i] :
( ( ( pos @ ( healthy @ ( A @ property1 ) ) )
& ( A @ person ) )
=> ~ ? [B: $i] :
( ( A = B )
& ( pos @ ( unhealthy @ ( B @ property1 ) ) ) ) )
& ! [A: $i] :
( ( ( pos @ ( unhealthy @ ( A @ property1 ) ) )
& ( A @ cyclist ) )
=> ? [B: $i] :
( ( A = B )
& ( pos @ ( dishonest @ ( B @ property1 ) ) ) ) )
& ! [A: $i] :
( ( A @ cyclist )
=> ? [B: $i] :
( ( A = B )
& ( pos @ ( industrious @ ( B @ property1 ) ) ) ) )
& ! [A: $i] :
( ( ( pos @ ( industrious @ ( A @ property1 ) ) )
& ( A @ grocer ) )
=> ? [B: $i] :
( ( A = B )
& ( pos @ ( honest @ ( B @ property1 ) ) ) ) )
& ! [A: $i] :
( ( A @ grocer )
=> ~ ? [B: $i] :
( ( A = B )
& ( pos @ ( healthy @ ( B @ property1 ) ) ) ) )
& ! [A: $i] :
( ( ( pos @ ( industrious @ ( A @ property1 ) ) )
& ( pos @ ( honest @ ( A @ property1 ) ) )
& ( A @ person ) )
=> ? [B: $i] :
( ( A = B )
& ( pos @ ( healthy @ ( B @ property1 ) ) ) ) ) )
=> ! [A: $i] :
( ( A @ grocer )
=> ~ ? [B: $i] :
( ( A = B )
& ( B @ cyclist ) ) ) ),
inference(neg_conjecture,[status(cth)],[1]) ).
thf(3,plain,
~ ( ( ! [A: $i] :
( ( A @ cyclist )
=> ? [B: $i] :
( ( A = B )
& ( B @ person ) ) )
& ! [A: $i] :
( ( A @ grocer )
=> ? [B: $i] :
( ( A = B )
& ( B @ person ) ) )
& ! [A: $i] :
( ( ( pos @ ( honest @ ( A @ property1 ) ) )
& ( A @ person ) )
=> ~ ? [B: $i] :
( ( A = B )
& ( pos @ ( dishonest @ ( B @ property1 ) ) ) ) )
& ! [A: $i] :
( ( ( pos @ ( healthy @ ( A @ property1 ) ) )
& ( A @ person ) )
=> ~ ? [B: $i] :
( ( A = B )
& ( pos @ ( unhealthy @ ( B @ property1 ) ) ) ) )
& ! [A: $i] :
( ( ( pos @ ( unhealthy @ ( A @ property1 ) ) )
& ( A @ cyclist ) )
=> ? [B: $i] :
( ( A = B )
& ( pos @ ( dishonest @ ( B @ property1 ) ) ) ) )
& ! [A: $i] :
( ( A @ cyclist )
=> ? [B: $i] :
( ( A = B )
& ( pos @ ( industrious @ ( B @ property1 ) ) ) ) )
& ! [A: $i] :
( ( ( pos @ ( industrious @ ( A @ property1 ) ) )
& ( A @ grocer ) )
=> ? [B: $i] :
( ( A = B )
& ( pos @ ( honest @ ( B @ property1 ) ) ) ) )
& ! [A: $i] :
( ( A @ grocer )
=> ~ ? [B: $i] :
( ( A = B )
& ( pos @ ( healthy @ ( B @ property1 ) ) ) ) )
& ! [A: $i] :
( ( ( pos @ ( industrious @ ( A @ property1 ) ) )
& ( pos @ ( honest @ ( A @ property1 ) ) )
& ( A @ person ) )
=> ? [B: $i] :
( ( A = B )
& ( pos @ ( healthy @ ( B @ property1 ) ) ) ) ) )
=> ! [A: $i] :
( ( A @ grocer )
=> ~ ? [B: $i] :
( ( A = B )
& ( B @ cyclist ) ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).
thf(47,plain,
$false,
inference(e,[status(thm)],[3]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : PUZ129+2 : TPTP v9.3.1. Released v4.0.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.10/0.39 % Computer : n008.cluster.edu
% 0.10/0.39 % Model : x86_64 x86_64
% 0.10/0.39 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.39 % Memory : 8046.5625MB
% 0.10/0.39 % OS : Linux 6.8.0-71-generic
% 0.10/0.39 % CPULimit : 300
% 0.10/0.39 % WCLimit : 300
% 0.10/0.39 % DateTime : Sat Sep 26 05:18:39 UTC 2026
% 0.10/0.39 % CPUTime :
% 0.10/0.39 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.88/0.97 % [INFO] Parsing problem /export/starexec/sandbox/benchmark/theBenchmark.p ...
% 1.29/1.17 % [INFO] Parsing done (188ms).
% 1.29/1.18 % [INFO] Running in sequential loop mode.
% 1.88/1.58 % [INFO] eprover registered as external prover.
% 1.88/1.59 % [INFO] Scanning for conjecture ...
% 2.30/1.72 % [INFO] Found a conjecture (or negated_conjecture) and 0 axioms. Running axiom selection ...
% 2.30/1.77 % [INFO] Axiom selection finished. Selected 0 axioms (removed 0 axioms).
% 2.30/1.77 % [INFO] Problem is first-order (TPTP FOF).
% 2.30/1.78 % [INFO] Type checking passed.
% 2.30/1.78 % [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.97/2.47 % External prover 'e' found a proof!
% 3.97/2.47 % [INFO] Killing All external provers ...
% 3.97/2.47 % Time passed: 1936ms (effective reasoning time: 1285ms)
% 3.97/2.47 % 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.97/2.47 % Axioms used in derivation (0):
% 3.97/2.47 % No. of inferences in proof: 4
% 3.97/2.47 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p : 1936 ms resp. 1285 ms w/o parsing
% 4.25/2.52 % SZS output start Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 4.25/2.52 % [INFO] Killing All external provers ...
%------------------------------------------------------------------------------