TSTP Solution File: NUM647^1 by Leo-III---1.7.10
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Leo-III---1.7.10
% Problem : NUM647^1 : TPTP v8.1.2. Released v3.7.0.
% Transfm : none
% Format : tptp:raw
% Command : run_Leo-III %s %d
% Computer : n018.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 : Tue May 7 08:00:20 EDT 2024
% Result : Theorem 2.62s 1.61s
% Output : Refutation 2.62s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 9
% Syntax : Number of formulae : 15 ( 7 unt; 5 typ; 0 def)
% Number of atoms : 11 ( 9 equ; 0 cnn)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 27 ( 8 ~; 0 |; 0 &; 16 @)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 2 ( 2 >; 0 *; 0 +; 0 <<)
% Number of symbols : 7 ( 4 usr; 5 con; 0-2 aty)
% Number of variables : 7 ( 0 ^ 7 !; 0 ?; 7 :)
% Comments :
%------------------------------------------------------------------------------
thf(nat_type,type,
nat: $tType ).
thf(x_type,type,
x: nat ).
thf(y_type,type,
y: nat ).
thf(z_type,type,
z: nat ).
thf(pl_type,type,
pl: nat > nat > nat ).
thf(1,conjecture,
y = z,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',satz8a) ).
thf(2,negated_conjecture,
y != z,
inference(neg_conjecture,[status(cth)],[1]) ).
thf(6,plain,
y != z,
inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).
thf(3,axiom,
( ( pl @ x @ y )
= ( pl @ x @ z ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',i) ).
thf(8,plain,
( ( pl @ x @ y )
= ( pl @ x @ z ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[3]) ).
thf(4,axiom,
! [A: $o] :
( ~ ~ A
=> A ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',et) ).
thf(10,plain,
$true,
inference(defexp_and_simp_and_etaexpand,[status(thm)],[4]) ).
thf(5,axiom,
! [A: nat,B: nat,C: nat] :
( ( B != C )
=> ( ( pl @ A @ B )
!= ( pl @ A @ C ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',satz8) ).
thf(11,plain,
! [A: nat,B: nat,C: nat] :
( ( B != C )
=> ( ( pl @ A @ B )
!= ( pl @ A @ C ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[5]) ).
thf(17,plain,
$false,
inference(cvc4,[status(thm)],[6,8,10,11]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : NUM647^1 : TPTP v8.1.2. Released v3.7.0.
% 0.12/0.15 % Command : run_Leo-III %s %d
% 0.15/0.36 % Computer : n018.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 300
% 0.15/0.36 % DateTime : Mon May 6 12:16:24 EDT 2024
% 0.15/0.36 % CPUTime :
% 0.98/0.86 % [INFO] Parsing problem /export/starexec/sandbox2/benchmark/theBenchmark.p ...
% 1.21/0.97 % [INFO] Parsing done (111ms).
% 1.21/0.98 % [INFO] Running in sequential loop mode.
% 1.67/1.18 % [INFO] eprover registered as external prover.
% 1.67/1.18 % [INFO] cvc4 registered as external prover.
% 1.67/1.18 % [INFO] Scanning for conjecture ...
% 1.75/1.22 % [INFO] Found a conjecture and 3 axioms. Running axiom selection ...
% 1.83/1.24 % [INFO] Axiom selection finished. Selected 3 axioms (removed 0 axioms).
% 1.83/1.25 % [INFO] Problem is higher-order (TPTP THF).
% 1.83/1.25 % [INFO] Type checking passed.
% 1.83/1.26 % [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.62/1.60 % External prover 'cvc4' found a proof!
% 2.62/1.60 % [INFO] Killing All external provers ...
% 2.62/1.60 % Time passed: 1073ms (effective reasoning time: 624ms)
% 2.62/1.60 % 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.62/1.61 % Axioms used in derivation (3): i, et, satz8
% 2.62/1.61 % No. of inferences in proof: 10
% 2.62/1.61 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p : 1073 ms resp. 624 ms w/o parsing
% 2.62/1.62 % SZS output start Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 2.62/1.62 % [INFO] Killing All external provers ...
%------------------------------------------------------------------------------