TSTP Solution File: NUM707^1 by Leo-III-SAT---1.7.10
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Leo-III-SAT---1.7.10
% Problem : NUM707^1 : TPTP v8.1.2. Released v3.7.0.
% Transfm : none
% Format : tptp:raw
% Command : run_Leo-III %s %d
% Computer : n032.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 10:45:18 EDT 2024
% Result : Theorem 1.91s 1.37s
% Output : Refutation 1.91s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 8
% Syntax : Number of formulae : 16 ( 10 unt; 6 typ; 0 def)
% Number of atoms : 10 ( 9 equ; 0 cnn)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 68 ( 4 ~; 0 |; 0 &; 64 @)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 3 ( 2 avg)
% Number of types : 1 ( 1 usr)
% Number of type conns : 5 ( 5 >; 0 *; 0 +; 0 <<)
% Number of symbols : 7 ( 5 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(pl_type,type,
pl: nat > nat > nat ).
thf(ts_type,type,
ts: nat > nat > nat ).
thf(suc_type,type,
suc: nat > nat ).
thf(1,conjecture,
( ( pl @ ( ts @ x @ y ) @ x )
= ( ts @ x @ ( suc @ y ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',satz28f) ).
thf(2,negated_conjecture,
( ( pl @ ( ts @ x @ y ) @ x )
!= ( ts @ x @ ( suc @ y ) ) ),
inference(neg_conjecture,[status(cth)],[1]) ).
thf(4,plain,
( ( pl @ ( ts @ x @ y ) @ x )
!= ( ts @ x @ ( suc @ y ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).
thf(5,plain,
( ( ts @ x @ ( suc @ y ) )
!= ( pl @ ( ts @ x @ y ) @ x ) ),
inference(lifteq,[status(thm)],[4]) ).
thf(3,axiom,
! [A: nat,B: nat] :
( ( ts @ A @ ( suc @ B ) )
= ( pl @ ( ts @ A @ B ) @ A ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',satz28b) ).
thf(6,plain,
! [A: nat,B: nat] :
( ( ts @ A @ ( suc @ B ) )
= ( pl @ ( ts @ A @ B ) @ A ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[3]) ).
thf(7,plain,
! [B: nat,A: nat] :
( ( ts @ A @ ( suc @ B ) )
= ( pl @ ( ts @ A @ B ) @ A ) ),
inference(cnf,[status(esa)],[6]) ).
thf(8,plain,
! [B: nat,A: nat] :
( ( ts @ A @ ( suc @ B ) )
= ( pl @ ( ts @ A @ B ) @ A ) ),
inference(lifteq,[status(thm)],[7]) ).
thf(9,plain,
( ( pl @ ( ts @ x @ y ) @ x )
!= ( pl @ ( ts @ x @ y ) @ x ) ),
inference(rewrite,[status(thm)],[5,8]) ).
thf(10,plain,
$false,
inference(simp,[status(thm)],[9]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.09 % Problem : NUM707^1 : TPTP v8.1.2. Released v3.7.0.
% 0.11/0.11 % Command : run_Leo-III %s %d
% 0.11/0.31 % Computer : n032.cluster.edu
% 0.11/0.31 % Model : x86_64 x86_64
% 0.11/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.31 % Memory : 8042.1875MB
% 0.11/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.31 % CPULimit : 300
% 0.11/0.31 % WCLimit : 300
% 0.11/0.31 % DateTime : Mon May 6 19:32:24 EDT 2024
% 0.11/0.31 % CPUTime :
% 0.73/0.74 % [INFO] Parsing problem /export/starexec/sandbox/benchmark/theBenchmark.p ...
% 1.01/0.86 % [INFO] Parsing done (118ms).
% 1.01/0.87 % [INFO] Running in sequential loop mode.
% 1.25/1.07 % [INFO] nitpick registered as external prover.
% 1.25/1.07 % [INFO] Scanning for conjecture ...
% 1.38/1.12 % [INFO] Found a conjecture and 1 axioms. Running axiom selection ...
% 1.38/1.14 % [INFO] Axiom selection finished. Selected 1 axioms (removed 0 axioms).
% 1.38/1.15 % [INFO] Problem is higher-order (TPTP THF).
% 1.38/1.15 % [INFO] Type checking passed.
% 1.38/1.15 % [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 ...
% 1.91/1.37 % [INFO] Killing All external provers ...
% 1.91/1.37 % Time passed: 940ms (effective reasoning time: 495ms)
% 1.91/1.37 % 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)>
% 1.91/1.37 % Axioms used in derivation (1): satz28b
% 1.91/1.37 % No. of inferences in proof: 10
% 1.91/1.37 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p : 940 ms resp. 495 ms w/o parsing
% 1.91/1.39 % SZS output start Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 1.91/1.39 % [INFO] Killing All external provers ...
%------------------------------------------------------------------------------