TSTP Solution File: PUZ129+2 by Leo-III---1.7.7
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Leo-III---1.7.7
% Problem : PUZ129+2 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_Leo-III %s %d
% Computer : n004.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:47:45 EDT 2023
% Result : Theorem 3.14s 1.72s
% Output : Refutation 3.49s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 11
% Syntax : Number of formulae : 14 ( 1 unt; 10 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 : 6 ( 6 >; 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_type,type,
person: $i > $o ).
thf(property1_type,type,
property1: $i > $i > $i > $o ).
thf(honest_type,type,
honest: $i ).
thf(pos_type,type,
pos: $i ).
thf(industrious_type,type,
industrious: $i ).
thf(healthy_type,type,
healthy: $i ).
thf(grocer_type,type,
grocer: $i > $o ).
thf(cyclist_type,type,
cyclist: $i > $o ).
thf(unhealthy_type,type,
unhealthy: $i ).
thf(dishonest_type,type,
dishonest: $i ).
thf(1,conjecture,
( ( ! [A: $i] :
( ( ( person @ A )
& ( property1 @ A @ honest @ pos )
& ( property1 @ A @ industrious @ pos ) )
=> ? [B: $i] :
( ( property1 @ B @ healthy @ pos )
& ( A = B ) ) )
& ! [A: $i] :
( ( grocer @ A )
=> ~ ? [B: $i] :
( ( property1 @ B @ healthy @ pos )
& ( A = B ) ) )
& ! [A: $i] :
( ( ( grocer @ A )
& ( property1 @ A @ industrious @ pos ) )
=> ? [B: $i] :
( ( property1 @ B @ honest @ pos )
& ( A = B ) ) )
& ! [A: $i] :
( ( cyclist @ A )
=> ? [B: $i] :
( ( property1 @ B @ industrious @ pos )
& ( A = B ) ) )
& ! [A: $i] :
( ( ( cyclist @ A )
& ( property1 @ A @ unhealthy @ pos ) )
=> ? [B: $i] :
( ( property1 @ B @ dishonest @ pos )
& ( A = B ) ) )
& ! [A: $i] :
( ( ( person @ A )
& ( property1 @ A @ healthy @ pos ) )
=> ~ ? [B: $i] :
( ( property1 @ B @ unhealthy @ pos )
& ( A = B ) ) )
& ! [A: $i] :
( ( ( person @ A )
& ( property1 @ A @ honest @ pos ) )
=> ~ ? [B: $i] :
( ( property1 @ B @ dishonest @ pos )
& ( A = B ) ) )
& ! [A: $i] :
( ( grocer @ A )
=> ? [B: $i] :
( ( person @ B )
& ( A = B ) ) )
& ! [A: $i] :
( ( cyclist @ A )
=> ? [B: $i] :
( ( person @ B )
& ( A = B ) ) ) )
=> ! [A: $i] :
( ( grocer @ A )
=> ~ ? [B: $i] :
( ( cyclist @ B )
& ( A = B ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove) ).
thf(2,negated_conjecture,
~ ( ( ! [A: $i] :
( ( ( person @ A )
& ( property1 @ A @ honest @ pos )
& ( property1 @ A @ industrious @ pos ) )
=> ? [B: $i] :
( ( property1 @ B @ healthy @ pos )
& ( A = B ) ) )
& ! [A: $i] :
( ( grocer @ A )
=> ~ ? [B: $i] :
( ( property1 @ B @ healthy @ pos )
& ( A = B ) ) )
& ! [A: $i] :
( ( ( grocer @ A )
& ( property1 @ A @ industrious @ pos ) )
=> ? [B: $i] :
( ( property1 @ B @ honest @ pos )
& ( A = B ) ) )
& ! [A: $i] :
( ( cyclist @ A )
=> ? [B: $i] :
( ( property1 @ B @ industrious @ pos )
& ( A = B ) ) )
& ! [A: $i] :
( ( ( cyclist @ A )
& ( property1 @ A @ unhealthy @ pos ) )
=> ? [B: $i] :
( ( property1 @ B @ dishonest @ pos )
& ( A = B ) ) )
& ! [A: $i] :
( ( ( person @ A )
& ( property1 @ A @ healthy @ pos ) )
=> ~ ? [B: $i] :
( ( property1 @ B @ unhealthy @ pos )
& ( A = B ) ) )
& ! [A: $i] :
( ( ( person @ A )
& ( property1 @ A @ honest @ pos ) )
=> ~ ? [B: $i] :
( ( property1 @ B @ dishonest @ pos )
& ( A = B ) ) )
& ! [A: $i] :
( ( grocer @ A )
=> ? [B: $i] :
( ( person @ B )
& ( A = B ) ) )
& ! [A: $i] :
( ( cyclist @ A )
=> ? [B: $i] :
( ( person @ B )
& ( A = B ) ) ) )
=> ! [A: $i] :
( ( grocer @ A )
=> ~ ? [B: $i] :
( ( cyclist @ B )
& ( A = B ) ) ) ),
inference(neg_conjecture,[status(cth)],[1]) ).
thf(3,plain,
~ ( ( ! [A: $i] :
( ( ( person @ A )
& ( property1 @ A @ honest @ pos )
& ( property1 @ A @ industrious @ pos ) )
=> ? [B: $i] :
( ( property1 @ B @ healthy @ pos )
& ( A = B ) ) )
& ! [A: $i] :
( ( grocer @ A )
=> ~ ? [B: $i] :
( ( property1 @ B @ healthy @ pos )
& ( A = B ) ) )
& ! [A: $i] :
( ( ( grocer @ A )
& ( property1 @ A @ industrious @ pos ) )
=> ? [B: $i] :
( ( property1 @ B @ honest @ pos )
& ( A = B ) ) )
& ! [A: $i] :
( ( cyclist @ A )
=> ? [B: $i] :
( ( property1 @ B @ industrious @ pos )
& ( A = B ) ) )
& ! [A: $i] :
( ( ( cyclist @ A )
& ( property1 @ A @ unhealthy @ pos ) )
=> ? [B: $i] :
( ( property1 @ B @ dishonest @ pos )
& ( A = B ) ) )
& ! [A: $i] :
( ( ( person @ A )
& ( property1 @ A @ healthy @ pos ) )
=> ~ ? [B: $i] :
( ( property1 @ B @ unhealthy @ pos )
& ( A = B ) ) )
& ! [A: $i] :
( ( ( person @ A )
& ( property1 @ A @ honest @ pos ) )
=> ~ ? [B: $i] :
( ( property1 @ B @ dishonest @ pos )
& ( A = B ) ) )
& ! [A: $i] :
( ( grocer @ A )
=> ? [B: $i] :
( ( person @ B )
& ( A = B ) ) )
& ! [A: $i] :
( ( cyclist @ A )
=> ? [B: $i] :
( ( person @ B )
& ( A = B ) ) ) )
=> ! [A: $i] :
( ( grocer @ A )
=> ~ ? [B: $i] :
( ( cyclist @ B )
& ( A = B ) ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).
thf(46,plain,
$false,
inference(e,[status(thm)],[3]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : PUZ129+2 : TPTP v8.1.2. Released v4.0.0.
% 0.12/0.15 % Command : run_Leo-III %s %d
% 0.16/0.36 % Computer : n004.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 19:50:55 EDT 2023
% 0.16/0.36 % CPUTime :
% 0.99/0.88 % [INFO] Parsing problem /export/starexec/sandbox/benchmark/theBenchmark.p ...
% 1.11/1.01 % [INFO] Parsing done (131ms).
% 1.38/1.02 % [INFO] Running in sequential loop mode.
% 1.73/1.22 % [INFO] eprover registered as external prover.
% 1.77/1.22 % [INFO] cvc4 registered as external prover.
% 1.77/1.23 % [INFO] Scanning for conjecture ...
% 1.77/1.30 % [INFO] Found a conjecture and 0 axioms. Running axiom selection ...
% 2.05/1.33 % [INFO] Axiom selection finished. Selected 0 axioms (removed 0 axioms).
% 2.05/1.33 % [INFO] Problem is first-order (TPTP FOF).
% 2.05/1.34 % [INFO] Type checking passed.
% 2.05/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.14/1.72 % External prover 'e' found a proof!
% 3.14/1.72 % [INFO] Killing All external provers ...
% 3.14/1.72 % Time passed: 1209ms (effective reasoning time: 694ms)
% 3.14/1.72 % 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.14/1.72 % Axioms used in derivation (0):
% 3.14/1.72 % No. of inferences in proof: 4
% 3.14/1.72 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p : 1209 ms resp. 694 ms w/o parsing
% 3.49/1.80 % SZS output start Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 3.49/1.80 % [INFO] Killing All external provers ...
%------------------------------------------------------------------------------