TSTP Solution File: NUM677^1 by Leo-III-SAT---1.7.12
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Leo-III-SAT---1.7.12
% Problem : NUM677^1 : TPTP v8.2.0. Released v3.7.0.
% Transfm : none
% Format : tptp:raw
% Command : run_Leo-III %s %d
% Computer : n003.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:47 EDT 2024
% Result : Theorem 2.95s 1.77s
% Output : Refutation 3.53s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 12
% Syntax : Number of formulae : 34 ( 18 unt; 7 typ; 0 def)
% Number of atoms : 43 ( 15 equ; 0 cnn)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 172 ( 18 ~; 8 |; 0 &; 140 @)
% ( 0 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 6 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 4 ( 4 >; 0 *; 0 +; 0 <<)
% Number of symbols : 9 ( 6 usr; 6 con; 0-2 aty)
% Number of variables : 38 ( 0 ^ 38 !; 0 ?; 38 :)
% 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(u_type,type,
u: nat ).
thf(more_type,type,
more: nat > nat > $o ).
thf(pl_type,type,
pl: nat > nat > nat ).
thf(5,axiom,
! [A: nat,B: nat,C: nat,D: nat] :
( ( A = B )
=> ( ( more @ C @ D )
=> ( more @ ( pl @ A @ C ) @ ( pl @ B @ D ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',satz19g) ).
thf(11,plain,
! [A: nat,B: nat,C: nat,D: nat] :
( ( A = B )
=> ( ( more @ C @ D )
=> ( more @ ( pl @ A @ C ) @ ( pl @ B @ D ) ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[5]) ).
thf(12,plain,
! [A: nat,B: nat] :
( ( A = B )
=> ! [C: nat,D: nat] :
( ( more @ C @ D )
=> ( more @ ( pl @ A @ C ) @ ( pl @ B @ D ) ) ) ),
inference(miniscope,[status(thm)],[11]) ).
thf(13,plain,
! [D: nat,C: nat,B: nat,A: nat] :
( ( A != B )
| ~ ( more @ C @ D )
| ( more @ ( pl @ A @ C ) @ ( pl @ B @ D ) ) ),
inference(cnf,[status(esa)],[12]) ).
thf(14,plain,
! [D: nat,C: nat,B: nat,A: nat] :
( ( A != B )
| ~ ( more @ C @ D )
| ( more @ ( pl @ A @ C ) @ ( pl @ B @ D ) ) ),
inference(lifteq,[status(thm)],[13]) ).
thf(15,plain,
! [C: nat,B: nat,A: nat] :
( ~ ( more @ B @ C )
| ( more @ ( pl @ A @ B ) @ ( pl @ A @ C ) ) ),
inference(simp,[status(thm)],[14]) ).
thf(6,axiom,
! [A: nat,B: nat] :
( ( pl @ A @ B )
= ( pl @ B @ A ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',satz6) ).
thf(16,plain,
! [A: nat,B: nat] :
( ( pl @ A @ B )
= ( pl @ B @ A ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[6]) ).
thf(17,plain,
! [B: nat,A: nat] :
( ( pl @ A @ B )
= ( pl @ B @ A ) ),
inference(cnf,[status(esa)],[16]) ).
thf(18,plain,
! [B: nat,A: nat] :
( ( pl @ A @ B )
= ( pl @ B @ A ) ),
inference(lifteq,[status(thm)],[17]) ).
thf(1,conjecture,
more @ ( pl @ z @ x ) @ ( pl @ u @ y ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',satz19h) ).
thf(2,negated_conjecture,
~ ( more @ ( pl @ z @ x ) @ ( pl @ u @ y ) ),
inference(neg_conjecture,[status(cth)],[1]) ).
thf(7,plain,
~ ( more @ ( pl @ z @ x ) @ ( pl @ u @ y ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).
thf(3,axiom,
x = y,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',i) ).
thf(8,plain,
x = y,
inference(defexp_and_simp_and_etaexpand,[status(thm)],[3]) ).
thf(9,plain,
y = x,
inference(lifteq,[status(thm)],[8]) ).
thf(19,plain,
~ ( more @ ( pl @ z @ x ) @ ( pl @ u @ x ) ),
inference(rewrite,[status(thm)],[7,9]) ).
thf(22,plain,
! [B: nat,A: nat] :
( ~ ( more @ ( pl @ z @ x ) @ ( pl @ B @ A ) )
| ( ( pl @ A @ B )
!= ( pl @ u @ x ) ) ),
inference(paramod_ordered,[status(thm)],[18,19]) ).
thf(23,plain,
~ ( more @ ( pl @ z @ x ) @ ( pl @ x @ u ) ),
inference(pattern_uni,[status(thm)],[22:[bind(A,$thf( u )),bind(B,$thf( x ))]]) ).
thf(32,plain,
! [B: nat,A: nat] :
( ~ ( more @ ( pl @ B @ A ) @ ( pl @ x @ u ) )
| ( ( pl @ A @ B )
!= ( pl @ z @ x ) ) ),
inference(paramod_ordered,[status(thm)],[18,23]) ).
thf(33,plain,
~ ( more @ ( pl @ x @ z ) @ ( pl @ x @ u ) ),
inference(pattern_uni,[status(thm)],[32:[bind(A,$thf( z )),bind(B,$thf( x ))]]) ).
thf(84,plain,
! [C: nat,B: nat,A: nat] :
( ~ ( more @ B @ C )
| ( ( more @ ( pl @ A @ B ) @ ( pl @ A @ C ) )
!= ( more @ ( pl @ x @ z ) @ ( pl @ x @ u ) ) ) ),
inference(paramod_ordered,[status(thm)],[15,33]) ).
thf(85,plain,
~ ( more @ z @ u ),
inference(pattern_uni,[status(thm)],[84:[bind(A,$thf( x )),bind(B,$thf( z )),bind(C,$thf( u ))]]) ).
thf(4,axiom,
more @ z @ u,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m) ).
thf(10,plain,
more @ z @ u,
inference(defexp_and_simp_and_etaexpand,[status(thm)],[4]) ).
thf(87,plain,
~ $true,
inference(rewrite,[status(thm)],[85,10]) ).
thf(88,plain,
$false,
inference(simp,[status(thm)],[87]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : NUM677^1 : TPTP v8.2.0. Released v3.7.0.
% 0.07/0.15 % Command : run_Leo-III %s %d
% 0.16/0.36 % Computer : n003.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 : Mon May 20 05:06:24 EDT 2024
% 0.16/0.36 % CPUTime :
% 0.83/0.85 % [INFO] Parsing problem /export/starexec/sandbox2/benchmark/theBenchmark.p ...
% 1.17/0.95 % [INFO] Parsing done (100ms).
% 1.17/0.96 % [INFO] Running in sequential loop mode.
% 1.41/1.16 % [INFO] nitpick registered as external prover.
% 1.41/1.17 % [INFO] Scanning for conjecture ...
% 1.76/1.22 % [INFO] Found a conjecture (or negated_conjecture) and 4 axioms. Running axiom selection ...
% 1.76/1.23 % [INFO] Axiom selection finished. Selected 4 axioms (removed 0 axioms).
% 1.76/1.25 % [INFO] Problem is higher-order (TPTP THF).
% 1.85/1.25 % [INFO] Type checking passed.
% 1.85/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.95/1.76 % [INFO] Killing All external provers ...
% 2.95/1.76 % Time passed: 1240ms (effective reasoning time: 796ms)
% 2.95/1.76 % 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.95/1.77 % Axioms used in derivation (4): satz19g, satz6, i, m
% 2.95/1.77 % No. of inferences in proof: 27
% 2.95/1.77 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p : 1240 ms resp. 796 ms w/o parsing
% 3.53/1.80 % SZS output start Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 3.53/1.80 % [INFO] Killing All external provers ...
%------------------------------------------------------------------------------