TSTP Solution File: NUM642^1 by Leo-III-SAT---1.7.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Leo-III-SAT---1.7.12
% Problem : NUM642^1 : TPTP v8.2.0. Released v3.7.0.
% Transfm : none
% Format : tptp:raw
% Command : run_Leo-III %s %d
% Computer : n022.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 21 01:35:33 EDT 2024
% Result : Theorem 2.31s 1.48s
% Output : Refutation 2.39s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 7
% Syntax : Number of formulae : 15 ( 10 unt; 5 typ; 0 def)
% Number of atoms : 10 ( 9 equ; 0 cnn)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 58 ( 4 ~; 0 |; 0 &; 54 @)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 3 ( 2 avg)
% Number of types : 1 ( 1 usr)
% Number of type conns : 3 ( 3 >; 0 *; 0 +; 0 <<)
% Number of symbols : 6 ( 4 usr; 3 con; 0-2 aty)
% Number of variables : 8 ( 0 ^ 8 !; 0 ?; 8 :)
% Comments :
%------------------------------------------------------------------------------
thf(nat_type,type,
nat: $tType ).
thf(x_type,type,
x: nat ).
thf(y_type,type,
y: nat ).
thf(suc_type,type,
suc: nat > nat ).
thf(pl_type,type,
pl: nat > nat > nat ).
thf(1,conjecture,
( ( suc @ ( pl @ x @ y ) )
= ( pl @ ( suc @ x ) @ y ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',satz4h) ).
thf(2,negated_conjecture,
( ( suc @ ( pl @ x @ y ) )
!= ( pl @ ( suc @ x ) @ y ) ),
inference(neg_conjecture,[status(cth)],[1]) ).
thf(4,plain,
( ( suc @ ( pl @ x @ y ) )
!= ( pl @ ( suc @ x ) @ y ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).
thf(5,plain,
( ( pl @ ( suc @ x ) @ y )
!= ( suc @ ( pl @ x @ y ) ) ),
inference(lifteq,[status(thm)],[4]) ).
thf(3,axiom,
! [A: nat,B: nat] :
( ( pl @ ( suc @ A ) @ B )
= ( suc @ ( pl @ A @ B ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',satz4d) ).
thf(6,plain,
! [A: nat,B: nat] :
( ( pl @ ( suc @ A ) @ B )
= ( suc @ ( pl @ A @ B ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[3]) ).
thf(7,plain,
! [B: nat,A: nat] :
( ( pl @ ( suc @ A ) @ B )
= ( suc @ ( pl @ A @ B ) ) ),
inference(cnf,[status(esa)],[6]) ).
thf(8,plain,
! [B: nat,A: nat] :
( ( pl @ ( suc @ A ) @ B )
= ( suc @ ( pl @ A @ B ) ) ),
inference(lifteq,[status(thm)],[7]) ).
thf(9,plain,
( ( suc @ ( pl @ x @ y ) )
!= ( suc @ ( pl @ x @ y ) ) ),
inference(rewrite,[status(thm)],[5,8]) ).
thf(10,plain,
$false,
inference(simp,[status(thm)],[9]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : NUM642^1 : TPTP v8.2.0. Released v3.7.0.
% 0.13/0.15 % Command : run_Leo-III %s %d
% 0.15/0.36 % Computer : n022.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 20 06:48:24 EDT 2024
% 0.15/0.36 % CPUTime :
% 0.95/0.85 % [INFO] Parsing problem /export/starexec/sandbox2/benchmark/theBenchmark.p ...
% 1.22/0.95 % [INFO] Parsing done (100ms).
% 1.22/0.96 % [INFO] Running in sequential loop mode.
% 1.59/1.17 % [INFO] nitpick registered as external prover.
% 1.59/1.17 % [INFO] Scanning for conjecture ...
% 1.68/1.22 % [INFO] Found a conjecture (or negated_conjecture) and 1 axioms. Running axiom selection ...
% 1.79/1.24 % [INFO] Axiom selection finished. Selected 1 axioms (removed 0 axioms).
% 1.79/1.25 % [INFO] Problem is higher-order (TPTP THF).
% 1.79/1.25 % [INFO] Type checking passed.
% 1.79/1.25 % [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.31/1.47 % [INFO] Killing All external provers ...
% 2.31/1.47 % Time passed: 952ms (effective reasoning time: 506ms)
% 2.31/1.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)>
% 2.31/1.48 % Axioms used in derivation (1): satz4d
% 2.31/1.48 % No. of inferences in proof: 10
% 2.31/1.48 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p : 952 ms resp. 506 ms w/o parsing
% 2.39/1.50 % SZS output start Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 2.39/1.50 % [INFO] Killing All external provers ...
%------------------------------------------------------------------------------