TSTP Solution File: NUM835+1 by Leo-III-SAT---1.7.15
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Leo-III-SAT---1.7.15
% Problem : NUM835+1 : TPTP v8.2.0. Released v4.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_Leo-III %s %d SAT
% Computer : n017.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 : Mon Jun 24 13:06:31 EDT 2024
% Result : Theorem 22.60s 4.56s
% Output : Refutation 22.63s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 2
% Syntax : Number of formulae : 24 ( 9 unt; 0 typ; 0 def)
% Number of atoms : 66 ( 54 equ; 0 cnn)
% Maximal formula atoms : 8 ( 2 avg)
% Number of connectives : 161 ( 17 ~; 35 |; 2 &; 102 @)
% ( 1 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 5 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of symbols : 9 ( 6 usr; 4 con; 0-2 aty)
% Number of variables : 46 ( 0 ^ 30 !; 16 ?; 46 :)
% Comments :
%------------------------------------------------------------------------------
thf(vd165_type,type,
vd165: $i ).
thf(vplus_type,type,
vplus: $i > $i > $i ).
thf(vd151_type,type,
vd151: $i ).
thf(m_type,type,
m: $i > $o ).
thf(sk6_type,type,
sk6: $i > $i > $i ).
thf(sk7_type,type,
sk7: $i > $i > $i ).
thf(24,axiom,
! [A: $i,B: $i] :
( ( m @ B )
<=> ( ( A = B )
| ? [C: $i] :
( A
= ( vplus @ B @ C ) )
| ? [C: $i] :
( B
= ( vplus @ A @ C ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','def(cond(conseq(105), 0), 1)') ).
thf(138,plain,
! [A: $i,B: $i] :
( ( ( m @ B )
=> ( ( A = B )
| ? [C: $i] :
( A
= ( vplus @ B @ C ) )
| ? [C: $i] :
( B
= ( vplus @ A @ C ) ) ) )
& ( ( ( A = B )
| ? [C: $i] :
( A
= ( vplus @ B @ C ) )
| ? [C: $i] :
( B
= ( vplus @ A @ C ) ) )
=> ( m @ B ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[24]) ).
thf(139,plain,
( ! [A: $i,B: $i] :
( ( m @ B )
=> ( ( A = B )
| ? [C: $i] :
( A
= ( vplus @ B @ C ) )
| ? [C: $i] :
( B
= ( vplus @ A @ C ) ) ) )
& ! [A: $i,B: $i] :
( ( ( A = B )
| ? [C: $i] :
( A
= ( vplus @ B @ C ) )
| ? [C: $i] :
( B
= ( vplus @ A @ C ) ) )
=> ( m @ B ) ) ),
inference(miniscope,[status(thm)],[138]) ).
thf(143,plain,
! [B: $i,A: $i] :
( ~ ( m @ B )
| ( A = B )
| ( A
= ( vplus @ B @ ( sk6 @ B @ A ) ) )
| ( B
= ( vplus @ A @ ( sk7 @ B @ A ) ) ) ),
inference(cnf,[status(esa)],[139]) ).
thf(150,plain,
! [B: $i,A: $i] :
( ( A = B )
| ( ( vplus @ B @ ( sk6 @ B @ A ) )
= A )
| ( ( vplus @ A @ ( sk7 @ B @ A ) )
= B )
| ~ ( m @ B ) ),
inference(lifteq,[status(thm)],[143]) ).
thf(140,plain,
! [B: $i,A: $i] :
( ( A != B )
| ( m @ B ) ),
inference(cnf,[status(esa)],[139]) ).
thf(144,plain,
! [B: $i,A: $i] :
( ( A != B )
| ( m @ B ) ),
inference(lifteq,[status(thm)],[140]) ).
thf(145,plain,
! [A: $i] : ( m @ A ),
inference(simp,[status(thm)],[144]) ).
thf(1657,plain,
! [B: $i,A: $i] :
( ( A = B )
| ( ( vplus @ B @ ( sk6 @ B @ A ) )
= A )
| ( ( vplus @ A @ ( sk7 @ B @ A ) )
= B )
| ~ $true ),
inference(rewrite,[status(thm)],[150,145]) ).
thf(1658,plain,
! [B: $i,A: $i] :
( ( A = B )
| ( ( vplus @ B @ ( sk6 @ B @ A ) )
= A )
| ( ( vplus @ A @ ( sk7 @ B @ A ) )
= B ) ),
inference(simp,[status(thm)],[1657]) ).
thf(1,conjecture,
( ? [A: $i] :
( vd165
= ( vplus @ vd151 @ A ) )
| ? [A: $i] :
( vd151
= ( vplus @ vd165 @ A ) )
| ( vd151 = vd165 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','dis(case_distinction(conseq(110)))') ).
thf(2,negated_conjecture,
~ ( ? [A: $i] :
( vd165
= ( vplus @ vd151 @ A ) )
| ? [A: $i] :
( vd151
= ( vplus @ vd165 @ A ) )
| ( vd151 = vd165 ) ),
inference(neg_conjecture,[status(cth)],[1]) ).
thf(41,plain,
~ ( ? [A: $i] :
( vd165
= ( vplus @ vd151 @ A ) )
| ? [A: $i] :
( vd151
= ( vplus @ vd165 @ A ) )
| ( vd151 = vd165 ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).
thf(44,plain,
! [A: $i] :
( vd165
!= ( vplus @ vd151 @ A ) ),
inference(cnf,[status(esa)],[41]) ).
thf(48,plain,
! [A: $i] :
( ( vplus @ vd151 @ A )
!= vd165 ),
inference(lifteq,[status(thm)],[44]) ).
thf(1735,plain,
! [C: $i,B: $i,A: $i] :
( ( A = B )
| ( ( vplus @ A @ ( sk7 @ B @ A ) )
= B )
| ( A != vd165 )
| ( ( vplus @ B @ ( sk6 @ B @ A ) )
!= ( vplus @ vd151 @ C ) ) ),
inference(paramod_ordered,[status(thm)],[1658,48]) ).
thf(1736,plain,
! [A: $i] :
( ( A = vd151 )
| ( ( vplus @ A @ ( sk7 @ vd151 @ A ) )
= vd151 )
| ( A != vd165 ) ),
inference(pattern_uni,[status(thm)],[1735:[bind(A,$thf( E )),bind(B,$thf( vd151 )),bind(C,$thf( sk6 @ vd151 @ E ))]]) ).
thf(1803,plain,
( ( vd151 = vd165 )
| ( ( vplus @ vd165 @ ( sk7 @ vd151 @ vd165 ) )
= vd151 ) ),
inference(simp,[status(thm)],[1736]) ).
thf(42,plain,
vd151 != vd165,
inference(cnf,[status(esa)],[41]) ).
thf(45,plain,
vd151 != vd165,
inference(lifteq,[status(thm)],[42]) ).
thf(43,plain,
! [A: $i] :
( vd151
!= ( vplus @ vd165 @ A ) ),
inference(cnf,[status(esa)],[41]) ).
thf(46,plain,
! [A: $i] :
( ( vplus @ vd165 @ A )
!= vd151 ),
inference(lifteq,[status(thm)],[43]) ).
thf(47,plain,
! [A: $i] :
( ( vplus @ vd165 @ A )
!= vd151 ),
inference(simp,[status(thm)],[46]) ).
thf(4315,plain,
$false,
inference(simplifyReflect,[status(thm)],[1803,45,47]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : NUM835+1 : TPTP v8.2.0. Released v4.1.0.
% 0.11/0.12 % Command : run_Leo-III %s %d SAT
% 0.12/0.33 % Computer : n017.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Sat Jun 22 23:00:10 EDT 2024
% 0.12/0.33 % CPUTime :
% 0.86/0.86 % [INFO] Parsing problem /export/starexec/sandbox/benchmark/theBenchmark.p ...
% 1.13/0.99 % [INFO] Parsing done (128ms).
% 1.13/1.00 % [INFO] Running in sequential loop mode.
% 1.72/1.20 % [INFO] nitpick registered as external prover.
% 1.72/1.21 % [INFO] Scanning for conjecture ...
% 1.84/1.27 % [INFO] Found a conjecture (or negated_conjecture) and 38 axioms. Running axiom selection ...
% 2.04/1.32 % [INFO] Axiom selection finished. Selected 38 axioms (removed 0 axioms).
% 2.04/1.36 % [INFO] Problem is first-order (TPTP FOF).
% 2.04/1.37 % [INFO] Type checking passed.
% 2.30/1.37 % [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 ...
% 22.60/4.52 % [INFO] Killing All external provers ...
% 22.60/4.54 % Time passed: 4010ms (effective reasoning time: 3536ms)
% 22.60/4.54 % 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)>
% 22.60/4.54 % Axioms used in derivation (1): def(cond(conseq(105), 0), 1)
% 22.60/4.56 % No. of inferences in proof: 24
% 22.60/4.56 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p : 4010 ms resp. 3536 ms w/o parsing
% 22.63/4.61 % SZS output start Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 22.63/4.61 % [INFO] Killing All external provers ...
%------------------------------------------------------------------------------